ACM Home Page
Please provide us with feedback. Feedback
On the integration of structure indexes and inverted lists
Full text PdfPdf (228 KB)
Source International Conference on Management of Data archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Paris, France
SESSION: Research sessions: text and DB table of contents
Pages: 779 - 790  
Year of Publication: 2004
ISBN:1-58113-859-8
Authors
Raghav Kaushik  University of Wisconsin, Madison
Rajasekar Krishnamurthy  University of Wisconsin, Madison
Jeffrey F. Naughton  University of Wisconsin, Madison
Raghu Ramakrishnan  University of Wisconsin, Madison
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 117,   Citation Count: 25
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1007568.1007656
What is a DOI?

ABSTRACT

Several methods have been proposed to evaluate queries over a native XML DBMS, where the queries specify both path and keyword constraints. These broadly consist of graph traversal approaches, optimized with auxiliary structures known as structure indexes; and approaches based on information-retrieval style inverted lists. We propose a strategy that combines the two forms of auxiliary indexes, and a query evaluation algorithm for branching path expressions based on this strategy. Our technique is general and applicable for a wide range of choices of structure indexes and inverted list join algorithms. Our experiments over the Niagara XML DBMS show the benefit of integrating the two forms of indexes. We also consider algorithmic issues in evaluating path expression queries when the notion of relevance ranking is incorporated. By integrating the above techniques with the Threshold Algorithm proposed by Fagin et al., we obtain instance optimal algorithms to push down top k computation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
A. Arion et al. XQueC: Pushing queries to compressed XML data. In VLDB, 2003.
 
5
G. Bhalotia et al. Keyword searching and browsing in databases using BANKS. In ICDE, 2002.
 
6
N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In ICDE, 2002.
7
 
8
P. Buneman, M. Grohe, and C. Koch. Path queries on compressed XML. In VLDB, 2003.
 
9
D. Chamberlin, D. Florescu, J. Robie, J. Siméon, and M. Stefanescu. XQuery: A query language for XML. World Wide Web Consortium, http://www.w3.org/TR/xquery, Feb 2000.
 
10
S. Chien, Z. Vagena, D. Zhang, V. J. Tsotras, and C. Zaniolo. Efficient structural joins on indexed XML documents. In VLDB, 2002.
 
11
 
12
13
14
 
15
N. Fuhr, M. Lalmas, and S. Malik. INEX: initiative for evaluation of XML retrieval. http://inex.is.informatik. uniduisburg.de:2003
 
16
 
17
18
 
19
A. Halverson et al. Mixed mode XML query processing. In VLDB, 2003.
20
 
21
V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style keyword search over relational databases. In VLDB, 2003.
 
22
 
23
H. Jiang, H. Lu, W. Wang, and B. C. Ooi. XR-Tree: Indexing XML Data for Efficient Structural Joins. In ICDE, 2003.
 
24
H. Jiang, H. Lu, W. Wang, and J. X. Yu. XParent: An Efficient RDBMS-Based XML Database System. In ICDE, 2002.
 
25
26
 
27
 
28
R. Luk et al. A survey of search engines for XML documents. In SIGIR Workshop on XML and IR, 2000.
 
29
Y. Mass, M. Mandelbrod, E. Amitay, Y. Maarek, and A. Soffer. JuruXML: An XML retrieval system. In INEX Workshop, 2002.
 
30
 
31
32
 
33
XML astronomy archive at NASA. http://xml.gsfc.nasa.gov/archive.
 
34
J. Naughton, D. DeWitt, D. Maier, et al. The Niagara Internet Query System. In IEEE Data Engineering Bulletin, 2001.
35
 
36
T. Schlieder and H. Meuss. Result ranking for structured queries against XML documents. In DELOS Workshop on Information Seeking, Searching and Querying in Digital Libraries, 2000.
 
37
D. Srivastava, S. Al-Khalifa, H. Jagadish, N. Koudas, J. Patel, and Y. Wu. Structural joins: A primitive for efficient XML query pattern matching. In ICDE, 2002.
 
38
 
39
Personal communication with Haixun Wang.
40
 
41
W. Wang, H. Jiang, H. Lu, and J. X. Yu. PBiTree Coding and Efficient Processing of Containment Joins. In ICDE, 2003.
 
42
XMark: The XML benchmark project. http://monetdb.cwi.nl/xml/index.html.
43

CITED BY  25
Collaborative Colleagues:
Raghav Kaushik: colleagues
Rajasekar Krishnamurthy: colleagues
Jeffrey F. Naughton: colleagues
Raghu Ramakrishnan: colleagues