Current search engines do not support queries that require a complex combination of information. Problems such as "Which theatre offers an at least-three-stars action movie in London close to a good Italian restaurant" can only be solved by asking multiple queries, possibly to different search engines, and then manually combining results, thereby performing "data integration in the brain." While searching the Web is the preferred method for accessing information in everyday's practice, users expect that search systems will soon be capable of mastering complex queries. However, combining information requires a drastic change of perspective: a new generation of search computing systems is needed, capable of going beyond the capabilities of current search engines. In this paper we show how search computing should open to modular composition, as many other kinds of software computations. We first motivate our work by describing our vision, and then describe how the challenges of multi-domain search are addressed by a prototype framework, whose internal "anatomy" is disclosed.
Original languageEnglish
Title of host publicationWeb Engineering - 11th International Conference, ICWE 2011, Proceedings
Place of PublicationBerlin
PublisherSpringer
Pages1-12
Number of pages12
Volume6757 LNCS
ISBN (Electronic)978-3-642-22233-7
ISBN (Print)9783642222320
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event11th International Conference on Web Engineering, ICWE 2011 - Berlin, Germany, Paphos, Cyprus
Duration: 20 Jun 201124 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6757 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Web Engineering, ICWE 2011
CountryCyprus
CityPaphos
Period20/06/1124/06/11

    Research areas

  • modular decomposition, multi-domain query, search computing, software architecture, Web information retrieval

ID: 45468568