Abstract
We demonstrate the Search Computing framework for multi-domain queries upon ranked data collected from Web sources. Search Computing answers to queries like "Find a good Jazz concert close to a specified location, a good restaurant and a hotel at walking distance" and fills the gap between generic and domain-specific search engines, by proposing new methods, techniques, interfaces, and tools for building search-based applications spanning multiple data services. The main enabling technology is an execution engine supporting methods for rank-join execution upon ranked data sources, abstracted and wrapped by means of a unifying service model. The demo walks through the interface for formulating multi-domain queries and follows the steps of the query engine that builds the result, with the help of run-time monitors that clearly explain the system's behavior. Once results are extracted, the demonstration shows several approaches for visualizing results and exploring the information space.
Original language | English |
---|---|
Title of host publication | Proceedings of SIGMOD 2011 and PODS 2011 |
Place of Publication | New York |
Publisher | Association for Computing Machinery (ACM) |
Pages | 1267-1269 |
Number of pages | 3 |
ISBN (Print) | 9781450306614 |
DOIs | |
Publication status | Published - 2011 |
Externally published | Yes |
Event | 2011 ACM SIGMOD and 30th PODS 2011 Conference - Athens, Greece Duration: 12 Jun 2011 → 16 Jun 2011 |
Conference
Conference | 2011 ACM SIGMOD and 30th PODS 2011 Conference |
---|---|
Country/Territory | Greece |
City | Athens |
Period | 12/06/11 → 16/06/11 |
Keywords
- exploratory search
- multi-domain queries
- search computing