A fast retrieval technique for large graph structures

Graphs are a typical and basic data structure for computer algorithms. A two-dimensional array and a list are well-known as for their representation. These data representations have contrasting features for retrieval time and space efficiency. Aho et al. [3] proposed a method for combining the compa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Journal of Computer Mathematics Ročník 60; číslo 3-4; s. 215 - 228
Hlavní autoři: Iriguchi, Hirokazu, Koyama, Masashi, Shishibori, Masami, Aoe, Jun-Ichi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Gordon and Breach Science Publishers 01.01.1996
Informa UK Limited
Taylor and Francis
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Data compressing
Exact sciences and technology
F.2.2[Nonnumerical Algorithms and problems]
Finite automata
Graph structures
H.3.3[Information search and retrieval]
Information retrieval. Graph
Performance E.1 Data Structure[Graphs]
Storing and retrieving
Theoretical computing
Worst-case time complexity
Data compression
Worst case method
Information retrieval
Finite automaton
Graph theory
Data structure
Algorithm
Time complexity
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Graphs are a typical and basic data structure for computer algorithms. A two-dimensional array and a list are well-known as for their representation. These data representations have contrasting features for retrieval time and space efficiency. Aho et al. [3] proposed a method for combining the compactness of the list with the fast retrieval of the array. Applications of Aho's scheme were, however, limited to static data structures because the updating algorithm was not given. By introducing three one-dimensional arrays based on Aho's data structure, called a triple-array structure, this paper proposes a method for updating arcs stored in the triple-array without degrading the worst-case retrieval time complexity 0(1). The triple-array maps arcs into two one-dimensional arrays CHECK and NEXT according to another one-dimensional array BASE. An updating algorithm presented here moves the initial positions of the arcs into other possible positions in the triple-array, by a first-fit strategy which searches the array CHECK starting from the head. For a large graph, the updating algorithm is improved by introducing the criterion of searching the array CHECK locally. Theoretical and experimental observations show that the updating time of the triple-array becomes practical while keeping the worstcase retrieval time complexity 0(1).
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207169608804487