Building Search Computing Applications

Search Computing aims at opening the Web to a new class of search applications, by offering enhanced expressive and computational power. The success of Search Computing, as of any technical advance, will be measured by its impact upon the search industry and market, and this in turn will be highly influenced by reactions of Web users and developers. It is too early to anticipate such reactions – as the technology is still “under construction” – but this chapter attempts a first identification of the possible future players in the development of Search Computing applications, by grossly identifying the roles of “data source publishers” and of “application developers”, and by discussing how classical advertising-based models may support the new applications. This chapter also describes the high-level design of the prototyping environment that is currently under development and how the design will support the deployment upon high performance architectures. Finally, we describe advertising as the prevalent business model of the search engines industry, and briefly discuss the options for the evolution of such model in the context of Search Computing.

[1]  Hemant K. Bhargava,et al.  Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms , 2007, INFORMS J. Comput..

[2]  Gerhard Weikum,et al.  From Centralized Workflow Specification to Distributed Workflow Execution , 1998, Journal of Intelligent Information Systems.

[3]  Philip S. Yu,et al.  The state of the art in locally distributed Web-server systems , 2002, CSUR.

[4]  Rajkumar Buyya,et al.  Article in Press Future Generation Computer Systems ( ) – Future Generation Computer Systems Cloud Computing and Emerging It Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility , 2022 .

[5]  Donald Kossmann,et al.  The state of the art in distributed query processing , 2000, CSUR.

[6]  Gregory Francis Pfister,et al.  In search of clusters (2nd ed.) , 1998 .

[7]  Gregory F. Pfister,et al.  In Search of Clusters , 1995 .

[8]  Jennifer Wortman Vaughan,et al.  Sponsored Search with Contexts , 2007, WINE.

[9]  Y. Narahari,et al.  Game Theoretic Problems in Network Economics and Mechanism Design Solutions , 2009, Advanced Information and Knowledge Processing.

[10]  Andre B. Bondi,et al.  Characteristics of scalability and their impact on performance , 2000, WOSP '00.

[11]  Brian Hayes,et al.  What Is Cloud Computing? , 2019, Cloud Technologies.

[12]  Roy T. Fielding,et al.  Hypertext Transfer Protocol - HTTP/1.1 , 1997, RFC.

[13]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

[14]  Douglas Stott Parker,et al.  Map-reduce-merge: simplified relational data processing on large clusters , 2007, SIGMOD '07.

[15]  G.S. Nezlek,et al.  Rich Internet Applications The Next Stage of Application Development , 2007, 2007 29th International Conference on Information Technology Interfaces.

[16]  Thomas A. Weber,et al.  A Model of Search Intermediaries and Paid Referrals , 2006, Inf. Syst. Res..

[17]  Alistair Moffat,et al.  Performance and Cost Tradeoffs in Web Search , 2004, ADC.

[18]  Ilya Segal,et al.  Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .

[19]  Fabio Casati,et al.  Understanding UI Integration: A Survey of Problems, Technologies, and Opportunities , 2007, IEEE Internet Computing.

[20]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[21]  Rakesh Agrawal,et al.  Symphony: A platform for search-driven applications , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[22]  David Abramson,et al.  Economic models for resource management and scheduling in Grid computing , 2002, Concurr. Comput. Pract. Exp..

[23]  Rakesh Agrawal,et al.  Symphony: Enabling Search-Driven Applications , 2009 .