ACM Home Page
Please provide us with feedback. Feedback
Containment join size estimation: models and methods
Full text PdfPdf (302 KB)
Source International Conference on Management of Data archive
Proceedings of the 2003 ACM SIGMOD international conference on Management of data table of contents
San Diego, California
SESSION: XML indexing and compression table of contents
Pages: 145 - 156  
Year of Publication: 2003
ISBN:1-58113-634-X
Authors
Wei Wang  The Hong Kong University of Science and Technology, Hong Kong, China
Haifeng Jiang  The Hong Kong University of Science and Technology, Hong Kong, China
Hongjun Lu  The Hong Kong University of Science and Technology, Hong Kong, China
Jeffrey Xu Yu  The Chinese University of Hong Kong, Hong Kong, China
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 69,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   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/872757.872777
What is a DOI?

ABSTRACT

Recent years witnessed an increasing interest in researches in XML, partly due to the fact that XML has now become the de facto standard for data interchange over the internet. A large amount of work has been reported on XML storage models and query processing techniques. However, few works have addressed issues of XML query optimization. In this paper, we report our study on one of the challenges in XML query optimization: containment join size estimation. Containment join is well accepted as an important operation in XML query processing. Estimating the size of its results is no doubt essential to generate efficient XML query processing plans. We propose two models, the interval model and the position model, and a set of estimation methods based on these two models. Comprehensive performance studies were conducted. The results not only demonstrate the advantages of our new algorithms over existing algorithms, but also provide valuable insights into the tradeoff among various parameters.


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
Walid G. Aref and Hanan Samet. A cost model for query optimization using R-Trees. In Proceedings of the Second ACM Workshop on Advances in Geographic Information Systems, pages 60--67, 1994.
 
7
 
8
 
9
10
11
12
13
14
 
15
16
17
 
18
 
19
Haifeng Jiang, Hongjun Lu, Wei Wang, and Beng Chin Ooi. XR-Tree: Indexing XML data for efficient structural joins. In Proceedings of the 19th International Conference on Data Engineering, 2003.
 
20
21
22
 
23
24
25
 
26
 
27
 
28
29


Collaborative Colleagues:
Wei Wang: colleagues
Haifeng Jiang: colleagues
Hongjun Lu: colleagues
Jeffrey Xu Yu: colleagues