skip to main content
10.1145/1595696.1595764acmconferencesArticle/Chapter ViewAbstractPublication PagesfseConference Proceedingsconference-collections
short-paper

Engineering search computing applications: vision and challenges

Published:24 August 2009Publication History

ABSTRACT

Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted from multiple Web resources; therefore, conventional crawling and indexing techniques, which look at individual Web pages, are not adequate for them. In this paper, we sketch the main characteristics of search computing and we highlight how various classical computer science disciplines - including software engineering, Web engineering, service-oriented architectures, data management, and human-computing interaction - are challenged by the search computing approach.

References

  1. Amazon. Elastic Compute Cloud (EC2). http://aws.amazon.com/ec2/Google ScholarGoogle Scholar
  2. D. Braga, A. Campi, S. Ceri, A. Raffio. Joining the results of heterogeneous search engines. Inf. Syst. 33(7-8): 658--680, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Braga, S. Ceri, F. Daniel, D. Martinenghi. Optimization of Muti-domain queries on the Web. VLDB'08, pp. 562--573, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Braga, S. Ceri, F. Daniel, D. Martinenghi. Mashing Up Search Services. IEEE Internet Computing 12(5): 16--23, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. I. Elgedawy, Z. Tari, and M. Winiko. Exact functional context matching for web services. In ICSOC, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83--99, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing partial rankings. SIAM J. Discrete Math., 20(3):628--648, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614--656, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C. Fellbaum, ed. WordNet: An Electronic Lexical Database (Language, Speech, and Communication). MIT Press, May 1998.Google ScholarGoogle ScholarCross RefCross Ref
  10. G. Gottlob, C. Koch, R. Baumgartner, M. Herzog, S. Flesca. The Lixto data extraction project: back and forth between theory and practice. ACM PODS 2004, Paris. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. B. Hayes. Cloud computing. Communications of the ACM 51(7): 9--11 (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. VLDB J., 13(3):207--221, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-query processing techniques in relational database systems. ACM Comput. Surv., 40(4), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Kossmann, F. Ramsak, S. Rost. Shooting stars in the sky: an online algorithm for skyline queries. In VLDB'02, pp. 275--286. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. N. Mamoulis, M. L.Yiu, K. H. Cheng, and D. W. Cheung. Efficient top-k aggregation of ranked inputs. ACM TODS, 32(3), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. D. Manning. Probabilistic Syntax. In Rens Bod, Jennifer Hay, and Stefanie Jannedy (eds), Probabilistic Linguistics, pp. 289--341. Cambridge, MA: MIT Press, 2003.Google ScholarGoogle Scholar
  17. MetaSearch. http://www.lib.berkeley.edu/TeachingLib/Guides/Internet/MetaSearch.html.Google ScholarGoogle Scholar
  18. D. Papadias, Y. Tao, G-Fu, and B. Seeger. Progressive skyline computation in database systems. ACM TODS, 30(1):41--82, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Papazouglu and K. Pohl eds, Wp 2009-2010 expert group: Longer term research challenges in software&services. 2008.Google ScholarGoogle Scholar
  20. A. A. Patil, S. A. Oundhakar, A. P. Sheth, and K. Verma. Meteor-s web service annotation framework. In WWW 2004, pp. 553--562. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. S. Ran. A model for web services discovery with QOS. SIGecom Exch., 4(1):1--10, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Stanford Natural Language Processing Group. Statistical parser. http://nlp.stanford.edu/software/lex-parser.shtmlGoogle ScholarGoogle Scholar
  23. M. Stollberg, U. Keller, H. Lausen, and S. Heymans. Two-phase web service discovery based on rich functional descriptions. In ESWC '07: pp. 99--113. Springer-Verlag, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Engineering search computing applications: vision and challenges

            Recommendations

            Comments

            Login options

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

            Sign in
            • Published in

              cover image ACM Conferences
              ESEC/FSE '09: Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
              August 2009
              408 pages
              ISBN:9781605580012
              DOI:10.1145/1595696

              Copyright © 2009 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]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 24 August 2009

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • short-paper

              Acceptance Rates

              ESEC/FSE '09 Paper Acceptance Rate32of217submissions,15%Overall Acceptance Rate112of543submissions,21%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader