Engineering search computing applications

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Engineering search computing applications: vision and challenges

Full text

Pdf (845 KB)

Source

Foundations of Software Engineering archive
Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium table of contents

Amsterdam, The Netherlands

SESSION: Challenge paper table of contents

Pages 365-372

Year of Publication: 2009

ISBN:978-1-60558-001-2

Authors

Marco Brambilla	Politecnico di Milano, Milano, Italy
Stefano Ceri	Politecnico di Milano, Milano, Italy

Sponsors

ACM: Association for Computing Machinery
SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 24, Downloads (12 Months): 43, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1595696.1595764 What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Amazon. Elastic Compute Cloud (EC2). http://aws.amazon.com/ec2/
	2	D. Braga, A. Campi, S. Ceri, A. Raffio. Joining the results of heterogeneous search engines. Inf. Syst. 33(7-8): 658--680, 2008.
	3	D. Braga, S. Ceri, F. Daniel, D. Martinenghi. Optimization of Muti-domain queries on the Web. VLDB'08, pp. 562--573, 2008.
	4	D. Braga, S. Ceri, F. Daniel, D. Martinenghi. Mashing Up Search Services. IEEE Internet Computing 12(5): 16--23, 2008.
	5	I. Elgedawy, Z. Tari, and M. Winiko. Exact functional context matching for web services. In ICSOC, 2004.
	6	R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83--99, 1999.
	7	R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing partial rankings. SIAM J. Discrete Math., 20(3):628--648, 2006.
	8	R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614--656, 2003.
	9	C. Fellbaum, ed. WordNet: An Electronic Lexical Database (Language, Speech, and Communication). MIT Press, May 1998.
	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.
	11	B. Hayes. Cloud computing. Communications of the ACM 51(7): 9--11 (2008).
	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.
	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.
	14	D. Kossmann, F. Ramsak, S. Rost. Shooting stars in the sky: an online algorithm for skyline queries. In VLDB'02, pp. 275--286.
	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.
	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.
	17	MetaSearch. http://www.lib.berkeley.edu/TeachingLib/Guides/Internet/MetaSearch.html.
	18	D. Papadias, Y. Tao, G-Fu, and B. Seeger. Progressive skyline computation in database systems. ACM TODS, 30(1):41--82, 2005.
	19	M. Papazouglu and K. Pohl eds, Wp 2009-2010 expert group: Longer term research challenges in software & services. 2008.
	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.
	21	S. Ran. A model for web services discovery with QOS. SIGecom Exch., 4(1):1--10, 2003.
	22	Stanford Natural Language Processing Group. Statistical parser. http://nlp.stanford.edu/software/lex-parser.shtml
	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.