Beyond basic faceted search

  • Authors:
  • Ori Ben-Yitzhak;Nadav Golbandi;Nadav Har'El;Ronny Lempel;Andreas Neumann;Shila Ofek-Koifman;Dafna Sheinwald;Eugene Shekita;Benjamin Sznajder;Sivan Yogev

  • Affiliations:
  • IBM Haifa Research Lab, Haifa, Israel;IBM Haifa Research Lab, Haifa, Israel;IBM Haifa Research Lab, Haifa, Israel;Yahoo! Research, Haifa, Israel;IBM Silicon Valley Lab, San Jose, CA;IBM Haifa Research Lab, Haifa, Israel;IBM Haifa Research Lab, Haifa, Israel;IBM Almaden Research Center, San Jose, CA;IBM Haifa Research Lab, Haifa, Israel;IBM Haifa Research Lab, Haifa, Israel

  • Venue:
  • WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper extends traditional faceted search to support richer information discovery tasks over more complex data models. Our first extension adds exible, dynamic business intelligence aggregations to the faceted application, enabling users to gain insight into their data that is far richer than just knowing the quantities of documents belonging to each facet. We see this capability as a step toward bringing OLAP capabilities, traditionally supported by databases over relational data, to the domain of free-text queries over metadata-rich content. Our second extension shows how one can efficiently extend a faceted search engine to support correlated facets - a more complex information model in which the values associated with a document across multiple facets are not independent. We show that by reducing the problem to a recently solved tree-indexing scenario, data with correlated facets can be efficiently indexed and retrieved