Sciweavers

35 search results - page 3 / 7
» Keyword search over key-value stores
Sort
View
IPTPS
2003
Springer
13 years 10 months ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
VLDB
1998
ACM
144views Database» more  VLDB 1998»
13 years 9 months ago
Proximity Search in Databases
An information retrieval IR engine can rank documents based on textual proximityof keywords within each document. In this paper we apply this notion to search across an entire dat...
Roy Goldman, Narayanan Shivakumar, Suresh Venkatas...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 2 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
MOBIDE
2003
ACM
13 years 10 months ago
Consistency mechanisms for a distributed lookup service supporting mobile applications
This paper presents a general-purpose distributed lookup service, denoted Passive Distributed Indexing (PDI). PDI stores entries in form of (key, value) pairs in index caches loca...
Christoph Lindemann, Oliver P. Waldhorst
COMPGEOM
2010
ACM
13 years 10 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park