Index Structures for Path Expressions

DMCA

Index Structures for Path Expressions (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Tova Milo , Dan Suciu

Citations:

334 - 7 self

BibTeX

@MISC{Milo97indexstructures,
    author = {Tova Milo and Dan Suciu},
    title = {Index Structures for Path Expressions},
    year = {1997}
}

OpenURL

Abstract

In recent years there has been an increased interest in managing data which does not conform to traditional data models, like the relational or object oriented model. The reasons for this non-conformance are diverse. One one hand, data may not conform to such models at the physical level: it may be stored in data exchange formats, fetched from the Internet, or stored as structured les. One the other hand, it may not conform at the logical level: data may have missing attributes, some attributes may be of di erent types in di erent data items, there may be heterogeneous collections, or the data may be simply specified by a schema which is too complex or changes too often to be described easily as a traditional schema. The term semistructured data has been used to refer to such data. The data model proposed for this kind of data consists of an edge-labeled graph, in which nodes correspond to objects and edges to attributes or values. Figure 1 illustrates a semistructured database providing information about a city. Relational databases are traditionally queried with associative queries, retrieving tuples based on the value of some attributes. To answer such queries efciently, database management systems support indexes for translating attribute values into tuple ids (e.g. B-trees or hash tables). In object-oriented databases, path queries replace the simpler associative queries. Several data structures have been proposed for answering path queries e ciently: e.g., access support relations 14] and path indexes 4]. In the case of semistructured data, queries are even more complex, because they may contain generalized path expressions 1, 7, 8, 16]. The additional exibility is needed in order to traverse data whose structure is irregular, or partially unknown to the user.

Keyphrases

path expression index structure path query heterogeneous collection attribute value access support relation path index semistructured database edge-labeled graph data consists data exchange format associative query traditional schema several data structure database management system support index structured le di erent data item generalized path expression simpler associative query traditional data model relational database increased interest additional exibility object-oriented database recent year data model logical level tuple id hash table physical level di erent type

DMCA