ACM Home Page
Please provide us with feedback. Feedback
A cost-based join selection for XML twig content-based queries
Full text PdfPdf (311 KB)
Source ACM International Conference Proceeding Series; Vol. 353 archive
Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web table of contents
Nantes, France
SESSION: Query processing table of contents
Pages 13-20  
Year of Publication: 2008
ISBN:978-1-59593-966-1
Authors
Radim Bača  Technical University of Ostrava
Michal Krátký  Czech Republic
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 85,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

XML (Extensible Mark-up Language) has been embraced as a new approach to data modeling. Nowadays, more and more information is formated as semi-structured data, e.g., articles in a digital library, documents on the web, and so on. Implementation of an efficient system enabling storage and querying of XML documents requires development of new techniques.

Many different techniques of XML indexing have been proposed during recent years. If we consider some classes of indexing methods, we distinguish two kinds of joins for processing twig queries. The first join merges two sets retrieved from an inverted list. The second join applies the first query result in building the second query. Although authors propose improvements of their joins, there has not yet been a discussion about the advantages of applying various join operations. In this article, we propose a join selection based on the cost of a join. By choosing a more appropriate join operation, twig query processing efficiency is significantly improved.


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
5
 
6
7
 
8
 
9
 
10
 
11
 
12
W. H. Hanyu Li, Mong Li Lee. A Path-Based Labeling Scheme for Efficient Structural Join. In Proceedings of XSym 2005, pages 34--48. Springer--Verlag, 2005.
 
13
 
14
 
15
M. Krátký, R. Bača, and V. Snášel. Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data. In Proceedings of the 18th International Conference on Database and Expert Systems Applications, DEXA 2007, volume LNCS 4653/2007. Springer--Verlag, 2007.
 
16
M. Krátký, J. Pokorný, and V. Snášel. Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data. In Current Trends in Database Technology, EDBT 2004, volume LNCS 3268/2004. Springer--Verlag, 2004.
 
17
 
18
19
 
20
N. May, M. Brantner, A. Böhm, C.-C. Kanne, and G. Moerkotte. Index vs. Navigation in XPath Evaluation. In Proceedings of Database and XML Technologies, XSym 2006, volume LNCS 4156/2006, pages 16--30. Springer--Verlag, 2006.
 
21
22
 
23
 
24
A. R. Schmidt and at al. The XML Benchmark. Technical Report INS-R0103, CWI, The Netherlands, April, 2001, http://monetdb.cwi.nl/xml/.
 
25
 
26
S. S. Prakas and S. Madria. SUCXENT: An Efficient Path-Based Approach to Store and Query XML Documents. In Proceedings of Database and Expert Systems Applications, DEXA 2004, volume LNCS 3180/2004, pages 285--295. Springer-Verlag, 2004.
27
 
28
M. van Keulen. Relational Approach to Logical Query Optimization of XPath. In Proceedings of the 1st Twente Data Management Workshop, TDM'04, pages 57--63, 2004.
 
29
W3 Consortium. XQuery 1.0: An XML Query Language, W3C Working Draft, 12 November 2003, http://www.w3.org/TR/xquery/.
 
30
W3 Consortium. XML Path Language (XPath) Version 2.0, W3C Working Draft, 15 November 2002, http://www.w3.org/TR/xpath20/.
 
31
 
32
Y. Wu, J. M. Patel, and H. Jagadish. Structural Join Order Selection for XML Query Optimization. In Proceedings of the 19th International Conference on Data Engineering, ICDE 2003, pages 443--454. IEEE Computer Society, 2003.
33


Collaborative Colleagues:
Radim Bača: colleagues
Michal Krátký: colleagues