메뉴 건너뛰기




Volumn , Issue , 2008, Pages 13-22

Minimum-effort driven dynamic faceted search in structured databases

Author keywords

Data browsing; Dynamic facet generation; Minimum effort entity search

Indexed keywords

APPLICATION SCENARIO; DATA BROWSING; DRILL-DOWN; ENTERPRISE DATABASE; EXPERIMENTAL STUDIES; FACETED SEARCH; MINIMUM-EFFORT ENTITY SEARCH; RANKED RETRIEVAL; RANKING FUNCTIONS; SELECTION ALGORITHM; STRUCTURED DATABASE;

EID: 70349250370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458088     Document Type: Conference Paper
Times cited : (103)

References (25)
  • 7
    • 33750181508 scopus 로고    scopus 로고
    • Probabilistic information retrieval approach for ranking of database query results
    • S. Chaudhuri, G. Das, V. Hristidis and G. Weikum. Probabilistic information retrieval approach for ranking of database query results. ACM Trans. Database Syst, 31(3): 1134-1168.
    • ACM Trans. Database Syst , vol.31 , Issue.3 , pp. 1134-1168
    • Chaudhuri, S.1    Das, G.2    Hristidis, V.3    Weikum, G.4
  • 9
    • 70349236663 scopus 로고    scopus 로고
    • J. Han and M. Kamber. Data Mining: Concepts and Techniques. The Morgan Kaufmann Series 2006.
    • J. Han and M. Kamber. Data Mining: Concepts and Techniques. The Morgan Kaufmann Series 2006.
  • 16
    • 70349240027 scopus 로고    scopus 로고
    • http://www.l3s.de/growbag/demonstrators.php.
  • 22
    • 0030364545 scopus 로고    scopus 로고
    • E. N. Efthimiadis. Query Expansion. Annual Review of Information Systems and Technology 1996.
    • E. N. Efthimiadis. Query Expansion. Annual Review of Information Systems and Technology 1996.


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