skip to main content
10.1145/1183614.1183679acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
Article

Heuristic containment check of partial tree-pattern queries in the presence of index graphs

Published: 06 November 2006 Publication History

Abstract

The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-pattern queries. The need for querying tree-structured data sources when their structure is not fully known, and the need to integrate multiple data sources with different tree structures have driven, recently, the suggestion of query languages that relax the complete specification of a tree pattern. In this paper, we use a query language which allows partial tree-pattern queries (PTPQs). The structure in a PTPQ can be flexibly specified fully, partially or not at all. To evaluate a PTPQ, we exploit index graphs which generate an equivalent set of "complete" tree-pattern queries.In order to process PTPQs, we need to efficiently solve the PTPQ satisfiability and containment problems. These problems become more complex in the context of PTPQs because the partial specification of the structure allows new, non-trivial, structural expressions to be derived from those explicitly specified in a PTPQ. We address the problem of PTPQ satisfiability and containment in the absence and in the presence of index graphs, and we provide necessary and sufficient conditions for each case. To cope with the high complexity of PTPQ containment in the presence of index graphs,we study a family of heuristic approaches for PTPQ containment based on structural information extracted from the index graph in advance and on-the-fly. We implement our approaches and we report on their extensive experimental evaluation and comparison.

References

[1]
XML Path Language (XPath).World Wide Web Consortium site, W3C XPath: http://www.w3.org/TR/xpath20.]]
[2]
XML Query (XQuery). World Wide Web Consortium site, W3C XQuery: http://www.w3.org/XML/Query.]]
[3]
S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Minimization of Tree Pattern Queries. In Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, pages 497--508, 2001, Santa Barbara, Cal, USA.]]
[4]
S. Amer-Yahia, S. Cho, and D. Srivastava. Tree Pattern Relaxation. In Proc. of the 8th Intl. Conf. on Extending Database Technology, Prague, Czech Republic, 2002.]]
[5]
A. Barta, M. P. Consens, and A. O. Mendelzon. Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods. In Proc. of the 31st Intl. Conf. on Very Large Data Bases, pages 133--144, 2005.]]
[6]
L. Chen and E. A. Rundensteiner. Xquery Containment in Presence of Variable Binding Dependencies. In Proc. of the 14th Intl. Conf. on World Wide Web, pages 288--297, 2005.]]
[7]
S. Cluet, P. Veltri, and D. Vodislav. Views in a large scale xml repository. In Proc. of the 27th Intl. Conf. on Very Large Data Bases, 2001.]]
[8]
S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. XSearch: A Semantic Search Engine for XML. In Proc. of the 29th Intl. Conf. on Very Large Data Bases, 2003.]]
[9]
A. Deutsch and V. Tannen. Containment and integrity constraints for xpath. In Proc. of the 8th Intl. Workshop on Knowledge Representation meets Databases, 2001.]]
[10]
X. Dong, A. Y. Halevy, and I. Tatarinov. Containment of Nested XML Queries. In Proc. of the 30th Intl. Conf. on Very Large Data Bases, pages 132--143, 2004.]]
[11]
R. Goldman and J. Widom. DataGuides: Enabling query formulation and optimization in semistructured databases. In Proc. of the 23rd Intl. Conf. on Very large Databases, pages 436--445, 1997.]]
[12]
J. Hidders. Satisfiability of XPath Expressions. In Proc. of the 9th Intl. Workshop on Database Programming Languages, pages 21--36, 2003.]]
[13]
V. Hristidis, Y. Papakonstantinou, and A. Balmin. Keyword Proximity Search on XML Graphs. In Proc. of the 19th Intl. Conf. on Data Engineering, pages 367--378, 2003.]]
[14]
R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering Indexes for Branching Path Queries. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Madison, USA, pages 133--144, 2002.]]
[15]
R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Exploiting Local Similarity for Indexing Paths in Graph-Structured data. In Proc. of the 18th Intl. Conf. on Data Engineering, pages 129--140, 2002.]]
[16]
L. V. S. Lakshmanan, G. Ramesh, H. W. Wang, and Z. J. Zhao. On Testing Satisfiability of Tree Pattern Queries. In Proc. of the 30th Intl. Conf. on Very Large Data Bases, pages 120--130, 2004.]]
[17]
Y. Li, C. Yu, and H. V. Jagadish. Schema-Free Xquery. In Proc. of the 30th Intl. Conf. on Very Large Data Bases, pages 72--83, 2004.]]
[18]
G. Miklau and D. Suciu. Containment and Equivalence for an XPath Fragment. In Proc. of the 21st ACM Symp. on Principles of Database Systems, pages 65--76, 2002.]]
[19]
T. Milo and D. Suciu. Index structures for Path Expressions. In Proc. of the 9th Intl. Conf. on Database Theory, pages 277--295, 1999.]]
[20]
F. Neven and T. Schwentick. XPath Containment in the Presence of Disjunction, DTDs, and Variables. In Proc. of the 13th Intl. Conf. on Database Theory, Sienna, Italy, pages 315--329, 2003.]]
[21]
N. Polyzotis and M. Garofalakis. Statistical Synopsis for Graph-structured XML Databases. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Madison, USA, 2002.]]
[22]
P. Ramanan. Efficient Algorithms for Minimizing Tree Pattern Queries. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Madison, USA, pages 299--309, 2002.]]
[23]
D. Theodoratos, T. Dalamagas, A. Koufopoulos, and N. Gehani. Semantic Querying of Tree-Structured Data Sources Using Partially Specified Tree-Patterns. In Proc. of the 14th ACM Intl. Conf. on Information and Knowledge Management, pages 712--719, 2005.]]
[24]
D. Theodoratos, T. Dalamagas, P. Placek, S. Souldatos, and T. Sellis. Containment of Partially Specified Tree-Pattern Queries. In Proc. of the Intl. Conference on Scientific and Statistical Databases, 2006.]]
[25]
P. T. Wood. Containment for XPath Fragments under DTD Constraints. In Proc. of the 13th Intl. Conf. on Database Theory, Sienna, Italy, pages 300--314, 2003.]]

Cited By

View all
  • (2017)Tree pattern matching in heterogeneous fuzzy XML databasesKnowledge-Based Systems10.1016/j.knosys.2017.02.003122:C(119-130)Online publication date: 15-Apr-2017
  • (2009)Efficient processing of partially specified twig pattern queriesScience in China Series F: Information Sciences10.1007/s11432-009-0152-352:10(1830-1847)Online publication date: 6-Oct-2009
  • (2009)Containment of partially specified tree-pattern queries in the presence of dimension graphsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-008-0097-y18:1(233-254)Online publication date: 1-Jan-2009
  • Show More Cited By

Index Terms

  1. Heuristic containment check of partial tree-pattern queries in the presence of index graphs

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management
      November 2006
      916 pages
      ISBN:1595934332
      DOI:10.1145/1183614
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 06 November 2006

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. partial tree-pattern query
      2. query containment
      3. tree-structured data

      Qualifiers

      • Article

      Conference

      CIKM06
      CIKM06: Conference on Information and Knowledge Management
      November 6 - 11, 2006
      Virginia, Arlington, USA

      Acceptance Rates

      Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

      Upcoming Conference

      CIKM '25

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 20 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2017)Tree pattern matching in heterogeneous fuzzy XML databasesKnowledge-Based Systems10.1016/j.knosys.2017.02.003122:C(119-130)Online publication date: 15-Apr-2017
      • (2009)Efficient processing of partially specified twig pattern queriesScience in China Series F: Information Sciences10.1007/s11432-009-0152-352:10(1830-1847)Online publication date: 6-Oct-2009
      • (2009)Containment of partially specified tree-pattern queries in the presence of dimension graphsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-008-0097-y18:1(233-254)Online publication date: 1-Jan-2009
      • (2008)A heuristic approach for checking containment of generalized tree-pattern queriesProceedings of the 17th ACM conference on Information and knowledge management10.1145/1458082.1458155(551-560)Online publication date: 26-Oct-2008
      • (2008)Efficient evaluation of generalized path pattern queries on XML dataProceedings of the 17th international conference on World Wide Web10.1145/1367497.1367610(835-844)Online publication date: 21-Apr-2008
      • (2007)An original semantics to keyword queries for XML using structural patternsProceedings of the 12th international conference on Database systems for advanced applications10.5555/1783823.1783903(727-739)Online publication date: 9-Apr-2007
      • (2007)Evaluation of partial path queries on xml dataProceedings of the sixteenth ACM conference on Conference on information and knowledge management10.1145/1321440.1321446(21-30)Online publication date: 6-Nov-2007
      • (2007)An Original Semantics to Keyword Queries for XML Using Structural PatternsAdvances in Databases: Concepts, Systems and Applications10.1007/978-3-540-71703-4_61(727-739)Online publication date: 2007

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media