Skip to main content
SpringerLink
Log in

Efficient subtree results computation for XML keyword queries

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

In this paper, we focus on efficient construction of restricted subtree (RSubtree) results for XML keyword queries on amulticore system. We firstly show that the performance bottlenecks for existing methods lie in 1) computing the set of relevant keyword nodes (RKNs) for each subtree root node, 2) constructing the corresponding RSubtree, and 3) parallel execution. We then propose a two-step generic top-down subtree construction algorithm, which computes SLCA/ELCA nodes in the first step, and parallelly gets RKNs and generates RSubtree results in the second step, where genericmeans that 1) our method can be used to compute different kinds of subtree results, 2) our method is independent of the query semantics; top-down means that our method constructs each RSubtree by visiting nodes of the subtree constructed based on an RKN set level-by-level from left to right, such that to avoid visiting as many useless nodes as possible. The experimental results show that our method is much more efficient than existing ones according to various metrics.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Zhou R, Liu C F, Li J X. Fast ELCA computation for keyword queries on XML data. In: Proceedings of the 13th International Conference on Extending Database Technology. 2010, 549–560

    Chapter  Google Scholar 

  2. Xu Y, Papakonstantinou Y. Efficient keyword search for smallest LCAs in XML databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2005, 537–538

    Google Scholar 

  3. Chen L J, Papakonstantinou Y. Supporting top-K keyword search in XML databases. In: Proceedings of the 26th International Conference on Data Engineering. 2010, 689–700

    Google Scholar 

  4. Guo L, Shao F, Botev C, Shanmugasundaram J. XRANK: ranked keyword search over XML Documents. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. 2003, 16–27

    Chapter  Google Scholar 

  5. Li Y Y, Yu C, Jagadish H V. Schema-free XQuery. In: Proceedings of the 13th International Conference on Very Large Data Bases. 2004, 72–83

    Google Scholar 

  6. Kong L B, Gilleron R, Lemay A. Retrieving meaningful relaxed tightest fragments for XML keyword search. In: Proceedings of the 12th International Conference on Extending Database Technology. 2009, 815–826

    Chapter  Google Scholar 

  7. Liu Z Y, Chen Y. Reasoning and identifying relevant matches for XML keyword search. The Proceedings of the VLOB Endowment, 2008, 1(1): 921–932

    Article  Google Scholar 

  8. Xu Y, Papakonstantinou Y. Efficient LCA based keyword search in XML data. In: Proceedings of the 11th International Conference on Extending Database Technology. 2008, 535–546

    Google Scholar 

  9. 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: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data. 2002, 204–215

    Chapter  Google Scholar 

  10. Hristidis V, Koudas N, Papakonstantinou Y, Srivastava D. Keyword proximity search in XML Trees. IEEE Transactions on Knowledge and Date Engineering, 2006, 18(4): 525–539

    Article  Google Scholar 

  11. Zhou J F, Bao Z F, Chen Z Y, Ling T W. Fast result enumeration for keyword queries on XML data. In: Proceedings of the 17th International Conference on Database Systems for Advanced Applications. 2012, 95–109

    Chapter  Google Scholar 

  12. Zhou J F, Bao Z F, Wang W, Ling T W, Chen Z Y, Lin X D, Guo J F. Fast SLCA and ELCA computation for XML keyword queries based on set intersection. In: Proceedings of the IEEE 28th International Conference on Data Engineering. 2012, 905–916

    Google Scholar 

  13. Zhou J F, Bao Z F, Chen Z Y, Lan G X, Lin X D, Ling T W. Top-down SLCA computation based on list partition. In: Proceedings of the 17th International Conference on Database Systems for Advanced Applications. 2012, 172–184

    Chapter  Google Scholar 

  14. Pandis I, Johnson R, Hardavellas N, Ailamaki A. Data-oriented transaction execution. The Proceedings of the VLOB Endowment, 2010, 3(1): 928–939

    Article  Google Scholar 

  15. Tsirogiannis D, Guha S, Koudas N. Improving the performance of list intersection. The Proceedings of the VLOB Endowment, 2009, 2(1): 838–849

    Article  Google Scholar 

  16. Bordawekar R, Lim L, Kementsietsidis A, K B. Statistics-based parallelization of XPath queries in shared memory systems. In: Proceedings of the 13th International Conference on Extending Database Technology. 2010, 159–170

    Chapter  Google Scholar 

  17. Qin L, Yu J X, Chang L J. Ten thousand SQLs: parallel keyword queries computing. The Proceedings of the VLOB Endowment, 2010, 3(1): 58–69

    Article  Google Scholar 

  18. Zhou J F, Zhao J J, Wang B, Zhao X M, Chen Z Y. Efficient MSubtree results computation for XML keyword queries. In: Proceedings of the 14th International Conference on Web-Age Information Management. 2013, 472–477

    Chapter  Google Scholar 

  19. Sun C, Chan C Y, Goenka A K. Multiway SLCA-based keyword search in XML data. In: Proceedings of the 16th International Conference on World Wide Web. 2007, 1043–1052

    Chapter  Google Scholar 

  20. Wang W Y, Wang X L, Zhou A Y. Hash-search: an efficient SLCA-based keyword search algorithm on XML documents. In: Proceedings of the 14th International Conference on Database Systems for Advanced Applications. 2009, 496–510

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Yanshan University, Hebei, 066004, China

    Ziyang Chen, Jia Liu, Xingmin Zhao & Junfeng Zhou

  2. Environmental Management College of China, Hebei, 066004, China

    Jia Liu

  3. The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province, Yanshan University, Hebei, 066004, China

    Ziyang Chen, Xingmin Zhao & Junfeng Zhou

Authors
  1. Ziyang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xingmin Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Junfeng Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jia Liu.

Additional information

Ziyang Chen received the PhD degree in computer science from Yanshan University, China. He is a professor of Yanshan University and a member of China Computer Federation. His research interests include relational database and XML keyword search.

Jia Liu received her MS degree in computer science from Yanshan University, China. She is currently a PhD candidate of Yanshan University. Her research interests include relational database and XML keyword search.

Xingmin Zhao received her MS degree in computer science from Yanshan University, China in 2014. Her research interests include XML keyword search.

Junfeng Zhou received the PhD degree in computer science from Renmin University of China in 2009. He is an associate professor of Yanshan University, China and a member of China Computer Federation. His research interests include XML structured query processing and XML keyword search.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Z., Liu, J., Zhao, X. et al. Efficient subtree results computation for XML keyword queries. Front. Comput. Sci. 9, 253–264 (2015). https://doi.org/10.1007/s11704-014-3473-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-014-3473-3

Keywords

Search

Navigation