Skip to main content
Log in

Fast Smallest Lowest Common Ancestor Computation Based on Stable Match

Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, we focus on efficient processing of XML keyword queries based on smallest lowest common ancestor (SLCA) semantics. For a given query Q with m keywords, we propose to use stable matches as the basis for SLCA computation, where each stable match M consists of m nodes that belong to the m distinct keyword inverted lists of Q. M satisfies that no other lowest common ancestor (LCA) node of Q can be found to be located after the first node of M and be a descendant of the LCA of M, based on which the operation of locating a stable match can skip more useless nodes. We propose two stable match based algorithms for SLCA computation, i.e., BSLCA and HSLCA. BSLCA processes two keyword inverted lists each time from the shortest to the longest, while HSLCA processes all keyword inverted lists in a holistic way to avoid the problem of redundant computation invoked by BSLCA. Our extensive experimental results verify the performance advantages of our methods according to various evaluation metrics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Cohen S, Mamou J, Kanza Y, Sagiv Y. XSEarch: A semantic search engine for XML. In Proc. the 29th International Conference on Very Large Data Bases (VLDB2003), September 2003, pp.45–56.

  2. Guo L, Shao F, Botev C, Shanmugasundavam J. XRANK: Ranked keyword search over XML documents. In Proc. the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD2003), June 2003, pp.16–27.

  3. Zhou R, Liu C, Li J. Fast ELCA computation for keyword queries on XML data. In Proc. the 13th International Conference on Extending Database Technology (EDBT2010), March 2010, pp.549–560.

  4. Xu Y, Papakonstantinou Y. Efficient keyword search for smallest LCAs in XML databases. In Proc. the ACM SIGMOD International Conference on Management of Data (SIGMOD2005), June 2005, pp.527–538.

  5. Li Y, Yu C, Jagadish H V. Schema-free xQuery. In Proc. the 30th International Conference on Very Large Data Bases (VLDB2004), Aug. 31-Sept. 3, 2004, pp.72–83.

  6. Chen L J, Papakonstantinou P. Supporting top-K keyword search in XML databases. In Proc. the 26th International Conference on Data Engineering (ICDE 2010), March 2010, pp.689–700.

  7. Sun C, Chan C Y, Goenka A K. Multiway SLCA-based keyword search in XML data. In Proc. the 16th International Conference on World Wide Web (WWW2007), May 2007, pp.1043–1052.

  8. Liu Z, Chen Y. Identifying meaningful return information for XML keyword search. In Proc. the 2007 ACM SIGMOD International Conference on Management of Data (SIGMOD2007), June 2007, pp.329–340.

  9. Bao Z, Ling T W, Chen B, Lu J. Effective XML keyword search with relevance oriented ranking. In Proc. the 25th International Conference on Data Engineering (ICDE 2009), March 2009, pp.517–528.

  10. Li G, Feng J, Wang J, Zhou L. Effective keyword search for valuable LCAs over XML documents. In Proc. the 6th ACM Conference on Information and Knowledge Management (CIKM2007), November 2007, pp.31–40.

  11. Li G, Ji S, Li C, Feng J. Efficient type-ahead search on relational data: A TASTIER approach. In Proc. the 2009 ACM SIGMOD International Conference on Management of Data (SIGMOD2009), June 29-July 2, 2009, pp.695–706.

  12. Tatarinov I, Viglas S, Beyer K S, Shanmugasundaram J, Shekita E J, Zhang C. Storing and querying ordered XML using a relational database system. In Proc. the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD2002), June 2002, pp.204–215.

  13. Xu Y, Papakonstantinou Y. Efficient LCA based keyword search in XML data. In Proc. the 11th International Conference on Extending Database Technology (EDBT2008), March 2008, pp.535–546.

  14. Chen Y, Wang W, Liu Z, Lin X. Keyword search on structured and semi-structured data. In Proc. the 2009 ACM SIGMOD International Conference on Management of Data (SIGMOD2009), June 29-July 2, 2009, pp.1005–1010.

  15. Chen Y, Wang W, Liu Z. Keyword-based search and exploration on databases. In Proc. the 27th International Conference on Data Engineering (ICDE 2011), April 2011, pp.1380–1383.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun-Feng Zhou.

Additional information

This research was partially supported by the National Natural Science Foundation of China under Grant Nos. 61073060, 61040023, 61272124, and the Science and Technology Research and Development Program of Hebei Province of China under Grant No. 11213578.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(DOC 27.5 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, JF., Lan, GX., Chen, ZY. et al. Fast Smallest Lowest Common Ancestor Computation Based on Stable Match. J. Comput. Sci. Technol. 28, 366–381 (2013). https://doi.org/10.1007/s11390-013-1337-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-013-1337-1

Keywords

Navigation