Abstract
Suppose that we have a DTD D and XML documents valid against D, and consider writing an XPath query to the documents. Unfortunately, a user often does not understand the entire structure of D exactly, especially in the case where D is very large and/or complex or D has been updated but the user misses it. In such cases, the user tends to write an incorrect XPath query q. However, it is difficult for the user to correct q by hand due to his/her lack of exact knowledge about the entire structure of D. In this paper, we propose an algorithm that finds, for an XPath query q, a DTD D, and a positive integer K, ”top-K” XPath queries ”most similar” to q among the XPath queries conforming to D so that a user select an appropriate query among the K queries. We also present some experimental studies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amer-Yahia, S., Cho, S., Srivastava, D.: Tree Pattern Relaxation. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 89–102. Springer, Heidelberg (2002)
Amer-Yahia, S., Lakshmanan, L.V., Pandit, S.: Flexpath: Flexible structure and full-text querying for xml. In: Proc. SIGMOD, pp. 83–94 (2004)
Choi, B.: What are real dtds like? In: Proc. WebDB, pp. 43–48 (2002)
Cohen, S., Brodianskiy, T.: Correcting queries for xml. Information Systems 34(8), 690–710 (2009)
Eppstein, D.: Finding the k shortest paths. SIAM J. Computing 28(2), 652–673 (1998)
Fazzinga, B., Flesca, S., Furfaro, F.: Xpath query relaxation through rewriting rules. IEEE Transactions on Knowledge and Data Engineering 23, 1583–1600 (2011)
Fazzinga, B., Flesca, S., Pugliese, A.: Retrieving xml data from heterogeneous sources through vague querying. ACM Trans. Internet Technol. 9(2), 7:1–7:35 (2009), http://doi.acm.org/10.1145/1516539.1516542
Ives, Z.G., Halevy, A.Y., Weld, D.S.: An xml query engine for network-bound data. The VLDB Journal 11(4), 380–402 (2002)
Li, G., Feng, J., Wang, J., Zhou, L.: Effective keyword search for valuable lcas over xml documents. In: Proc. ACM CIKM, CIKM 2007, pp. 31–40. ACM (2007)
Li, Y., Yu, C., Jagadish, H.V.: Schema-free xquery. In: Proc. VLDB, pp. 72–83 (2004)
Li, Y., Yu, C., Jagadish, H.V.: Enabling schema-free xquery with meaningful query focus. The VLDB Journal 17, 355–377 (2008)
Martins, E.: K-th shortest paths problem, http://www.mat.uc.pt/~eqvm/OPP/KSPP/KSPP.html
Marzal, A., Vidal, E.: Computation of normalized edit distance and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 15, 926–932 (1993)
Morishima, A., Kitagawa, H., Matsumoto, A.: A machine learning approach to rapid development of xml mapping queries. In: Proc. ICDE, pp. 276–287 (2004)
Schenkel, R., Theobald, M.: Feedback-Driven Structural Query Expansion for Ranked Retrieval of XML Data. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 331–348. Springer, Heidelberg (2006)
Schlieder, T.: Schema-Driven Evaluation of Approximate Tree-Pattern Queries. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 514–532. Springer, Heidelberg (2002), http://dl.acm.org/citation.cfm?id=645340.650204
Schmidt, A., Waas, F., Kersten, M., Carey, M., Manolescu, I., Busse, R.: Xmark: A benchmark for xml data managemet. In: Proc. VLDB, pp. 974–985 (2002)
Termehchy, A., Winslett, M.: Using structural information in xml keyword search effectively. ACM Trans. Database Syst. 36(1), 4 (2011)
Xu, Y., Papakonstantinou, Y.: Efficient keyword search for smallest lcas in xml databases. In: Proc. ACM SIGMOD Conf., pp. 527–538. ACM (2005)
Wu, Y., Lele, N., Aroskar, R., Chinnusamy, S., Brenes, S.: Xqgen: an algebra-based xpath query generator for micro-benchmarking. In: Proc. CIKM, pp. 2109–2110 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikeda, K., Suzuki, N. (2012). Finding Top-K Correct XPath Queries of User’s Incorrect XPath Query. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32600-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-32600-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32599-1
Online ISBN: 978-3-642-32600-4
eBook Packages: Computer ScienceComputer Science (R0)