de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

HOPI: An Efficient Connection Index for Complex XML Document Collections

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45380

Schenkel,  Ralf
Databases and Information Systems, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45608

Theobald,  Anja
Databases and Information Systems, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Schenkel, R., Theobald, A., & Weikum, G. (2004). HOPI: An Efficient Connection Index for Complex XML Document Collections. In Advances in database technology, EDBT 2004: 9th International Conference on Extending Database Technology (pp. 237-255). Berlin, Germany: Springer.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-2AB6-8
Zusammenfassung
In this paper we present {\em HOPI}, a new connection index for XML documents based on the concept of the 2--hop cover of a directed graph introduced by Cohen et al. In contrast to most of the prior work on XML indexing we consider not only paths with child or parent relationships between the nodes, but also provide space-- and time--efficient reachability tests along the ancestor, descendant, and link axes to support path expressions with wildcards in our XXL search engine. We improve the theoretical concept of a 2--hop cover by developing scalable methods for index creation on very large XML data collections with long paths and extensive cross--linkage, and for incremental index maintenance. Our experiments show substantial savings in the query performance of the HOPI index over previously proposed index structures, in combination with low space requirements and efficient updates.