On the integration of structure indexes and inverted lists

Recently, there has been a great deal of interest in the development of techniques to evaluate path expressions over collections of XML documents. In general, these path expressions contain both structural and keyword components. Several methods have been proposed for processing path expressions ove...

Full description

Saved in:
Bibliographic Details
Main Authors: Raghav Kaushik, Rajasekar Krishnamurthy, Naughton, J.F., Raghu Ramakrishnan
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Bridges
Computer science
control theory
systems
Content addressable storage
Exact sciences and technology
Indexing
Information retrieval
Information systems. Data bases
Keyword search
Memory organisation. Data processing
Middleware
Proposals
Query processing
Software
Tree graphs
XML
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recently, there has been a great deal of interest in the development of techniques to evaluate path expressions over collections of XML documents. In general, these path expressions contain both structural and keyword components. Several methods have been proposed for processing path expressions over graph/tree-structured XML data. These methods can be classified into two broad classes. The first involves graph traversal where the input query is evaluated by traversing the data graph or some compressed representation. The other class involves information-retrieval style processing using inverted lists. In this framework, structure indexes have been proposed to be used as a substitute for graph traversal. Here, we focus on a subclass of CAS queries consisting of simple path expressions. We study algorithmic issues in integrating structure indexes with inverted lists for the evaluation of these queries, where we rank all documents that match the query and return the top k documents in order of relevance.
ISSN:1063-6382
2375-026X
DOI:10.1109/ICDE.2004.1320060