Adaptive relaxation for querying heterogeneous XML data sources

Information Systems

Volumn 35, Issue 6, 2010, Pages 688-707

  Liu, Chengfei ^a   Li, Jianxin ^a   Yu, Jeffrey Xu ^b   Zhou, Rui ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Top k query; XML relaxation; XML schema

Indexed keywords

INFORMATION RETRIEVAL; SEARCH ENGINES; XML;

QUERY RELAXATION; STRUCTURAL HETEROGENEITY; STRUCTURED QUERIES; TOP-K QUERY; TOP-K QUERY PROCESSING; WEIGHTED MODELS; XML DATA SOURCES; XML SCHEMAS;

QUERY PROCESSING;

EID: 77955231128     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2010.02.002     Document Type: Article

References (32)

1. S. Amer-Yahia, S. Cho, D. Srivastava, Tree pattern relaxation, in: EDBT, 2002, pp. 496513.
2. S. Amer-Yahia, L.V.S. Lakshmanan, S. Pandit, FleXPath: flexible structure and full-text querying for XML, in: SIGMOD, 2004, pp. 8394.
3. A. Marian, S. Amer-Yahia, N. Koudas, D. Srivastava, Adaptive processing of top-K queries in XML, in: ICDE, 2005, pp. 162173.
4. A.Y. Halevy, Answering queries using views: a survey, VLDB J. (2001) 270294.
5. A.P. Sheth, J.A. Larson, Federated database systems for managing distributed, heterogeneous, and autonomous databases, ACM Comput. Surv. (1990) 183236.
6. B. Ding, J.X. Yu, S. Wang, L. Qin, X. Zhang, X. Lin, Finding top-k min-cost connected trees in databases, in: ICDE, 2007, pp. 836845.
7. G.J. Bex, F. Neven, T. Schwentick, K. Tuyls, Inference of concise DTDs from XML data, in: VLDB, 2006, pp. 115126.
8. G.J. Bex, F. Neven, S. Vansummeren, Inferring XML schema definitions from XML data, in: VLDB, 2007, pp. 9981009.
9. H. Weinblatt, A new search algorithm for finding the simple cycles of a finite directed graph, JACM 19(1) (1972) 4356.
10. B. Choi, G. Cong, W. Fan, S.D. Viglas, Updating recursive XML views of relations, in: ICDE, 2007, pp. 766775.
11. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms 2001 The MIT Press, Cambridge, MA
12. Wutka DTD parser 〈 http://www.wutka.com/dtdparser.html 〉.
13. Oracle Berkeley DB XML 2.3 〈 http://www.oracle.com/database/ berkeley-db/xml/index.html 〉.
14. XMark XML data generator 〈 http://monetdb.cwi.nl/xml/index.html 〉.
15. A. Schmidt, F. Waas, M. Kersten, M. Carey, I. Manolescu, R. Busse, XMark: a benchmark for XML data management, in: VLDB, 2002, pp. 974985.
16. C. Delobel, M.-C. Rousset, A uniform approach for querying large tree-structured data through a mediated schema, in: International Workshop on Foundations of Models for Information Integration, 2001.
17. T. Schlieder, Similarity search in XML data using cost-based query transformations, in: WebDB, 2001, pp. 1924.
18. N. Koudas, C. Li, A.K.H. Tung, R. Vernica, Relaxing join and selection queries, in: VLDB, 2006, pp. 199210.
19. S. Liu, W.W. Chu, R. Shahinian, Vague content and structure (VCAS) retrieval for document-centric XML collections, in: WebDB, 2005, pp. 7984.
20. X. Zhou, J. Gaugaz, W.-T. Balke, W. Nejdl, Query relaxation using malleable schemas, in: SIGMOD, 2007, pp. 545556.
21. M.J. Carey, D. Kossmann, On saying "Enough Already!" in SQL, in: SIGMOD, 1997, pp. 219230.
22. N. Bruno, S. Chaudhuri, and L. Gravano Top-k selection queries over relational databases: mapping strategies and performance evaluation ACM Trans. Database Syst. 27 2 2002 153 187
23. C.-M. Chen, Y. Ling, A sampling-based estimator for top-k query, in: ICDE, 2002, pp. 617627.
24. R. Fagin, Fuzzy queries in multimedia database systems, in: PODS, 1998, pp. 110.
25. R. Fagin, A. Lotem, M. Naor, Optimal aggregation algorithms for middleware, in: PODS, 2001, pp. 102113.
26. R. Fagin Combining fuzzy information: an overview SIGMOD Record 31 2 2002 109 118
27. R. Fagin, Combining fuzzy information from multiple systems, in: PODS, 1996, pp. 216226.
28. A. Marian, N. Bruno, and L. Gravano Evaluating top-k queries over web-accessible databases ACM Trans. Database Syst. 29 2 2004 319 362
29. K.C.-C. Chang, S.-w. Hwang, Minimal probing: supporting expensive predicates for top-k queries, in: SIGMOD, 2002, pp. 346357.
30. P. Cao, Z. Wang, Efficient top-K query calculation in distributed networks, in: PODC, 2004, pp. 206215.
31. M. Theobald, R. Schenkel, G. Weikum, An efficient and versatile query engine for TopX search, in: VLDB, 2005, pp. 625636. (Pubitemid 43991039)
32. R. Kaushik, R. Krishnamurthy, J.F. Naughton, R. Ramakrishnan, On the integration of structure indexes and inverted lists, in: SIGMOD Conference, 2004, pp. 779790.