OpenSearch is a set of simple formats for the sharing of search results. Any website that has a search feature can make their results available in OpenSearch™ format. Other tools can then read those search results. For example, here is an aggregator tha
Introduction
On several occasions developing database-driven web applications, I've been approached by clients who want Google-style search implemented at the last minute of the development cycle. Usually this leads to using some canned script that crawls the website, or a hacked up search function that uses the database but either returns too many results or none at all. On top of that, the queries performed are too many or too slow.
Until now, most developers have been forced to use relational databases to power search, install extra component packages, or seek out other non-php solutions. The problem with using a relational database, such as MySql's fulltext indexing, is that scalability problems crop up as your search criteria becomes more complicated.
One of the features that sets the Zend Framework apart from the others is the inclusion of a decent search module. Zend_Search_Lucene is a php port of the Apache Lucene project, a full-text search engine framework. Zend_Search_Lucene promises a simple way to add search functionality to an application without requiring additional php extensions or even a database.
Zend_Search_Lucene overcomes the usual limitations of relational databases with features such as fast indexing, ranked result sets, a powerful but simple query syntax, and the ability to index multiple fields. Better still, a Zend_Search_Lucene index can live happily alongside your relational database to provide fast searching but without duplicating the effort of storing all of your data twice. In this tutorial, I'll show you how to use Zend_Search_Lucene to index and search some RSS feeds.
A. Broder, M. Najork, и J. Wiener. WWW '03: Proceedings of the 12th international conference on World Wide Web, стр. 679--689. New York, NY, USA, ACM, (2003)
C. Dwork, R. Kumar, M. Naor, и D. Sivakumar. WWW '01: Proceedings of the 10th international conference on World Wide Web, стр. 613--622. New York, NY, USA, ACM Press, (2001)
G. Manku, A. Jain, и A. Sarma. WWW '07: Proceedings of the 16th international conference on World Wide Web, стр. 141--150. New York, NY, USA, ACM, (2007)
R. Baeza-Yates, и C. Castillo. Soft Computing Systems - Design, Management and, стр. 565--572. IOS Press Amsterdam, Berlin, Oxford, Tokyo, Washington, (2002)
S. Brin, и L. Page. http://ilpubs.stanford.edu:8090/361/, (1998)In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at http://google.stanford.edu/. To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description we know of to date. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want..