메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1021-1030

Answering approximate queries over autonomous Web databases

Author keywords

Query relaxation; Query results ranking; Top k; Web database

Indexed keywords

APPROXIMATE QUERY; ATTRIBUTE WEIGHT; CORRESPONDING WEIGHTS; DATABASE WORKLOAD; PRE-PROCESSING STEP; QUERY RELAXATION; QUERY RESULTS; QUERY RESULTS RANKING; QUERY TIME; RANKING METHODS; TOP-K; USER QUERY; USER STUDY; WEB DATABASE;

EID: 77954303174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1526709.1526846     Document Type: Conference Paper
Times cited : (29)

References (23)
  • 4
    • 43449097520 scopus 로고    scopus 로고
    • Empty versus overabundant answers to flexible relational queries
    • Bosc, P., Hadjali, A., and Pivert, O. Empty versus overabundant answers to flexible relational queries. Fuzzy Sets and Systems, 159, 1450-1467, 2007.
    • (2007) Fuzzy Sets and Systems , vol.159 , pp. 1450-1467
    • Bosc, P.1    Hadjali, A.2    Pivert, O.3
  • 5
    • 35448930799 scopus 로고    scopus 로고
    • Addressing diverse user preferences in SQL-Query-Result navigation
    • Chen, Z. Y. and Li, T. Addressing diverse user preferences in SQL-Query-Result navigation. In Proceedings of the SIGMOD Conference, 641-652, 2007.
    • (2007) Proceedings of the SIGMOD Conference , pp. 641-652
    • Chen, Z.Y.1    Li, T.2
  • 7
    • 28044474073 scopus 로고    scopus 로고
    • The reverse greedy algorithm for the metric k-median problem
    • Chrobak, M., Keynon, C., and Young, N. The reverse greedy algorithm for the metric k-median problem. Information Processing Letters 97, 68-72, 2005.
    • (2005) Information Processing Letters , vol.97 , pp. 68-72
    • Chrobak, M.1    Keynon, C.2    Young, N.3
  • 8
    • 33750181508 scopus 로고    scopus 로고
    • Probabilistic information retrieval approach for ranking of database query results
    • Chaudhuri, S., Das, G., and Hristidis, V. Probabilistic information retrieval approach for ranking of database query results. ACM Trans. Database Syst., 31(3):1134-1168, 2006.
    • (2006) ACM Trans. Database Syst. , vol.31 , Issue.3 , pp. 1134-1168
    • Chaudhuri, S.1    Das, G.2    Hristidis, V.3
  • 10
    • 3142632034 scopus 로고    scopus 로고
    • Preference formulas in relational queries
    • Chomicki, J. Preference formulas in relational queries. ACM Trans. Database Syst., 28(4): 427-466, 2003.
    • (2003) ACM Trans. Database Syst. , vol.28 , Issue.4 , pp. 427-466
    • Chomicki, J.1
  • 14
    • 4043126187 scopus 로고    scopus 로고
    • Foundations of preferences in database systems
    • Kießling, W. Foundations of preferences in database systems. In Proceedings of the VLDB Conference, 311-322, 2002.
    • (2002) Proceedings of the VLDB Conference , pp. 311-322
    • Kießling, W.1
  • 15
    • 33751071878 scopus 로고    scopus 로고
    • Generalization of strategies for fuzzy query translation in classical relational databases
    • Ma, Z. M. and Yan, L. Generalization of strategies for fuzzy query translation in classical relational databases. Information and Software Technology, 49(2):172-180, 2007.
    • (2007) Information and Software Technology , vol.49 , Issue.2 , pp. 172-180
    • Ma, Z.M.1    Yan, L.2
  • 19
    • 12244281114 scopus 로고    scopus 로고
    • Machine learning for online query relaxation
    • Muslea, I. Machine learning for online query relaxation. In Proceedings of the KDD Conference, 246-255, 2004.
    • (2004) Proceedings of the KDD Conference , pp. 246-255
    • Muslea, I.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.