At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Search services are now ubiquitously employed in searching for documents on the Internet and on enterprise intranets. This research develops an economic model for comparing search...
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
Web search engines respond to a query by returning more results than can be reasonably reviewed. These results typically include the title, link, and snippet of content from the t...