research-article

FACeTOR: cost-driven exploration of faceted query results

Authors:

Abhijith Kashyap,

Vagelis Hristidis,

Michalis PetropoulosAuthors Info & Claims

CIKM '10: Proceedings of the 19th ACM international conference on Information and knowledge management

Pages 719 - 728

https://doi.org/10.1145/1871437.1871530

Published: 26 October 2010 Publication History

Abstract

Faceted navigation is being increasingly employed as an effective technique for exploring large query results on structured databases. This technique of mitigating information-overload leverages metadata of the query results to provide users with facet conditions that can be used to progressively refine the user's query and filter the query results. However, the number of facet conditions can be quite large, thereby increasing the burden on the user. We present the FACeTOR system that proposes a cost-based approach to faceted navigation. At each step of the navigation, the user is presented with a subset of all possible facet conditions that are selected such that the overall expected navigation cost is minimized and every result is guaranteed to be reachable by a facet condition. We prove that the problem of selecting the optimal facet conditions at each navigation step is NP-Hard, and subsequently present two intuitive heuristics employed by FACeTOR. Our user study at Amazon Mechanical Turk shows that FACeTOR reduces the user navigation time compared to the cutting edge commercial and academic faceted search algorithms. The user study also confirms the validity of our cost model. We also present the results of an extensive experimental evaluation on the performance of the proposed approach using two real datasets. FACeTOR is available at http://db.cse.buffalo.edu/facetor/.

References

[1]

B. Aditya, G. Bhalotia, S. Chakrabarti, A. Hulgeri, C. Nakhe, Parag, S. Sudarshan: BANKS: Browsing and Keyword Searching in Relational Databases. VLDB 2002: 1083--1086.

Digital Library

[2]

Amazon Mechanical Turk. Online: https://www.mturk.com

[3]

M. Bergman. (2000) The Deep Web: Surfacing Hidden Value. {Online} Available: http://brightplanet.com/index.php/white-papers/119.html

[4]

K. Chakrabarti, S. Chaudhuri, S. Hwang: Automatic Categorization of Query Results. SIGMOD Conference 2004: 755--766.

Digital Library

[5]

S. Chaudhuri, G. Das, V. Hristidis, G. Weikum: Probabilistic Information Retrieval Approach for Ranking of Database Query Results. ACM Trans. Database Syst. 31(3): 1134--1168 (2006).

Digital Library

[6]

V. Chvatal: A Greedy Heuristic for the Set Cover Problem. Mathematics of Operations Research 4(3): 233--235 (1979).

Digital Library

[7]

J. Diederich, W. Balke: The Semantic GrowBag Algorithm: Automatically Deriving Categorization Systems. ECDL 2007: 1--13.

Digital Library

[8]

J. English, M. A. Hearst, R. R. Sinha, K. Swearingen, K. Yee: Hierarchical Faceted Metadata in Site Search Interfaces. CHI Extended Abstracts 2002: 628--639.

Digital Library

[9]

M. A. Hearst: Clustering versus Faceted Categories for Information Exploration. Commun. ACM 49(4): 59--61 (2006).

Digital Library

[10]

M. A. Hearst: User Interfaces and Visualization. Modern Information Retrieval. Ricardo Baeza-Yates and Berthier Ribeiro-Neto, Eds. ACM Press, New York, 1999, 257--323.

[11]

V. Hristidis, L. Gravano, Y. Papakonstantinou: Efficient IR-Style Keyword Search over Relational Databases. VLDB 2003: 850--861.

Digital Library

[12]

V. Hristidis, H. Hwang, Y. Papakonstantinou: Authority-Based Keyword Search in Databases. ACM TODS. 33(1): (2008).

Digital Library

[13]

A. Kashyap, V. Hristidis, M. Petropoulos, S. Tavoulari. BioNav: Effective Navigation on Query Results of BioMedical Databases. ICDE 2009: 1287--1290.

Digital Library

[14]

Medical Subject Headings http://www.nlm.nih.gov/mesh/

[15]

M. Ortega-Binderberger, K. Chakrabarti, S. Mehrotra: An Approach to Integrating Query Refinement in SQL. EDBT 2002: 15--33.

Digital Library

[16]

. http://www.ncbi.nlm.nih.gov/ /

[17]

S. B. Roy, H. Wang, G. Das, U. Nambiar, M. K. Mohania: Minimum-Effort Driven Dynamic Faceted Search in Structured Databases. CIKM 2008: 13--22.

Digital Library

[18]

N. Sarkas, N. Bansal, G. Das, N. Koudas: Measure-driven Keyword-Query Expansion. PVLDB 2(1): 121--132 (2009).

Digital Library

[19]

Vélez, R. Weiss, M. A. Sheldon, D. K. Gifford: Fast and Effective Query Refinement. SIGIR 1997: 6--15.

Digital Library

[20]

P. Wu, Y. Sismanis, B. Reinwald: Towards Keyword-Driven Analytical Processing. SIGMOD Conference 2007: 617--628.

Digital Library

[21]

K. Yee, K. Swearingen, K. Li, M. A. Hearst: Faceted Metadata for Image Search and Browsing. CHI 2003: 401--4.

Digital Library

Cited By

Panev KMichel S(2022)Concept and Computation of Ranking-based DominanceInformation Systems10.1016/j.is.2019.05.00484:C(174-188)Online publication date: 20-Apr-2022
https://dl.acm.org/doi/10.1016/j.is.2019.05.004
Câmara AMaxwell DHauff C(2022)Searching, Learning, and Subtopic Ordering: A Simulation-Based AnalysisAdvances in Information Retrieval10.1007/978-3-030-99736-6_10(142-156)Online publication date: 5-Apr-2022
https://doi.org/10.1007/978-3-030-99736-6_10
Rahman PJiang LNandi A(2019)Evaluating interactive data systemsThe VLDB Journal10.1007/s00778-019-00589-2Online publication date: 13-Nov-2019
https://doi.org/10.1007/s00778-019-00589-2
Show More Cited By

Index Terms

FACeTOR: cost-driven exploration of faceted query results
1. Human-centered computing
  1. Human computer interaction (HCI)
    1. Interaction paradigms
      1. Graphical user interfaces
  2. Interaction design
    1. Interaction design process and methods
      1. User centered design
2. Information systems
  1. Information retrieval
    1. Retrieval models and ranking
    2. Retrieval tasks and goals
      1. Document filtering
      2. Information extraction

Recommendations

Comprehension-based result snippets
CIKM '12: Proceedings of the 21st ACM international conference on Information and knowledge management

Result snippets are used by most search interfaces to preview query results. Snippets help users quickly decide the relevance of the results, thereby reducing the overall search time and effort. Most work on snippets have focused on text snippets for ...
SemFacet: semantic faceted search over yago
WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide Web

In this paper we demonstrate a system SemFacet, that is a proof of concept prototype for our semantic faceted search approach. SemFacet is implemented on top of the Yago knowledge base, powered by the OWL 2 RL triple store RDFox, and the full text ...
DeepEye: Creating Good Data Visualizations by Keyword Search
SIGMOD '18: Proceedings of the 2018 International Conference on Management of Data

Creating good visualizations for ordinary users is hard, even with the help of the state-of-the-art interactive data visualization tools, such as Tableau, Qlik, because they require the users to understand the data and visualizations very well. DeepEye ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '10: Proceedings of the 19th ACM international conference on Information and knowledge management

October 2010

2036 pages

ISBN:9781450300995

DOI:10.1145/1871437

General Chair:
Jimmy Huang
York University, Canada
,
Program Chairs:
Nick Koudas
University of Toronto, Canada
,
Gareth Jones
Dublin City University, Ireland
,
Xindong Wu
University of Vermont, USA
,
Kevyn Collins-Thompson
Microsoft Research, USA
,
Aijun An
York University, Canada

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 October 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CIKM '10

Sponsor:

CIKM '10: International Conference on Information and Knowledge Management

October 26 - 30, 2010

ON, Toronto, Canada

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

48
Total Citations
View Citations
423
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Panev KMichel S(2022)Concept and Computation of Ranking-based DominanceInformation Systems10.1016/j.is.2019.05.00484:C(174-188)Online publication date: 20-Apr-2022
https://dl.acm.org/doi/10.1016/j.is.2019.05.004
Câmara AMaxwell DHauff C(2022)Searching, Learning, and Subtopic Ordering: A Simulation-Based AnalysisAdvances in Information Retrieval10.1007/978-3-030-99736-6_10(142-156)Online publication date: 5-Apr-2022
https://doi.org/10.1007/978-3-030-99736-6_10
Rahman PJiang LNandi A(2019)Evaluating interactive data systemsThe VLDB Journal10.1007/s00778-019-00589-2Online publication date: 13-Nov-2019
https://doi.org/10.1007/s00778-019-00589-2
Panev KMichel S(2018)Exploring Pros and Cons of Ranked Entities with COMPETEProceedings of the 5th International Workshop on Exploratory Search in Databases and the Web10.1145/3214708.3214709(1-6)Online publication date: 15-Jun-2018
https://dl.acm.org/doi/10.1145/3214708.3214709
Jiang LRahman PNandi ADas GJermaine CBernstein P(2018)Evaluating Interactive Data SystemsProceedings of the 2018 International Conference on Management of Data10.1145/3183713.3197386(1637-1644)Online publication date: 27-May-2018
https://dl.acm.org/doi/10.1145/3183713.3197386
Tran VFuhr N(2018)Personalised Session Difficulty Prediction in an Online Academic Search EngineDigital Libraries for Open Knowledge10.1007/978-3-030-00066-0_15(174-185)Online publication date: 5-Sep-2018
https://doi.org/10.1007/978-3-030-00066-0_15
Kasemsap K(2017)Mastering Web Mining and Information Retrieval in the Digital AgeWeb Usage Mining Techniques and Applications Across Industries10.4018/978-1-5225-0613-3.ch001(1-28)Online publication date: 2017
https://doi.org/10.4018/978-1-5225-0613-3.ch001
Tran VMaxwell DFuhr NAzzopardi LKamps JKanoulas Ede Rijke MFang HYilmaz E(2017)Personalised Search Time Prediction using Markov ChainsProceedings of the ACM SIGIR International Conference on Theory of Information Retrieval10.1145/3121050.3121085(237-240)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1145/3121050.3121085
Liu XZhai CHan WGungor OBarrett RCummings RAgichtein EGabrilovich E(2017)Numerical Facet Range PartitionProceedings of the 26th International Conference on World Wide Web Companion10.1145/3041021.3054195(662-671)Online publication date: 3-Apr-2017
https://dl.acm.org/doi/10.1145/3041021.3054195
Beltran JHuang ZAbouzied ANandi APapadopoulos GKuflik TChen FDuarte CFu W(2017)Don't Just Swipe Left, Tell Me WhyProceedings of the 22nd International Conference on Intelligent User Interfaces10.1145/3025171.3025212(469-480)Online publication date: 7-Mar-2017
https://dl.acm.org/doi/10.1145/3025171.3025212
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents