ACM Home Page
Please provide us with feedback. Feedback
Answering approximate queries over autonomous web databases
Full text PdfPdf (1.02 MB)
Source
International World Wide Web Conference archive
Proceedings of the 18th international conference on World wide web table of contents
Madrid, Spain
SESSION: XML and web data/session: XML querying table of contents
Pages 1021-1030  
Year of Publication: 2009
ISBN:978-1-60558-487-4
Authors
Xiangfu Meng  Northeastern University, Shenyang, China
Z. M. Ma  Northeastern University, Shenyang, China
Li Yan  Northeastern University, Shenyang, China
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 15,   Downloads (12 Months): 95,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1526709.1526846
What is a DOI?

ABSTRACT

To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and ranked query results. Based on the user original query, we speculate how much the user cares about each specified attribute and assign a corresponding weight to it. This original query is then rewritten as an approximate query by relaxing the query criteria range. The relaxation order of all specified attributes and the relaxed degree on each specified attribute are varied with the attribute weights. For the approximate query results, we generate users' contextual preferences from database workload and use them to create a priori orders of tuples in an off-line preprocessing step. Only a few representative orders are saved, each corresponding to a set of contexts. Then, these orders and associated contexts are used at query time to expeditiously provide ranked answers. Results of a preliminary user study demonstrate that our query relaxation and results ranking methods can capture the user's preferences effectively. The efficiency and effectiveness of our approach is also demonstrated by experimental result.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
Agrawal, S., Chaudhuri, S., Das, G., and Gionis, A. Automated ranking of database query results. ACM Trans. Database Syst., 28(2): 140--174, 2003.
 
4
5
6
 
7
8
9
10
 
11
Cohen, W. W., Schapire, R. E. Learning to order things. Journal of Artificial Intelligence Research, 10, 243--270, 1999.
12
13
 
14
 
15
 
16
 
17
 
18
Ortega, B. M. Integrating similarity based retrieval and query refinement in databases. Ph.D Dissertation, UIUC, 2003.
19
 
20
Rui, Y., Huang, T. S., and Merhotra, S. Content-based image retrieval with relevance feedback in MARS. In Proceedings of the ICIP Conference, 815--818, 1997.
 
21
Stefanidis, K. and Pitoura, E. Adding context to preferences. In Proceedings of the ICDE Conference, 846--855, 2007.
22
 
23

Collaborative Colleagues:
Xiangfu Meng: colleagues
Z. M. Ma: colleagues
Li Yan: colleagues