- Xin Luna DongAffiliated withAT&T Labs–Research
- , Divesh SrivastavaAffiliated withAT&T Labs–Research
XML employs an ordered, tree-structured model for representing data. Queries in XML languages like XQuery employ twig queries to match relevant portions of data in an XML database. An XML Index is a data structure that is used to efficiently look up all matches of a fragment of the twig query, where some of the twig query fragment nodes may have been mapped to specific nodes in the XML database.
XML path indexing is related to the problem of join indexing in relational database systems  and path indexing in object-oriented database systems (see, e.g., [1,9]). These index structures assume that the schema is homogeneous and known; these assumptions do not hold in general for XML data. The DataGuide  was the first path index designed specifically for XML data, where the schema may be heterogeneous and may not even be known.
An XML document d is a rooted, ordered, node-labeled tree, where (i) ...
Reference Work Entry Metrics
- XML Indexing
- Reference Work Title
- Encyclopedia of Database Systems
- pp 3585-3591
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. College of Computing, Georgia Institute of Technology
- 2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo
- Author Affiliations
- 1. AT&T Labs–Research, Florham Park, NJ, USA
To view the rest of this content please follow the download PDF link above.