Sciweavers

2269 search results - page 240 / 454
» Query Incentive Networks
Sort
View
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
15 years 11 months ago
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
170
Voted
SEMWEB
2001
Springer
15 years 10 months ago
An RDF Framework for Resource Discovery
Resource discovery is a problem common to almost all distributed systems. Instead of resulting in a one or a small number of discovery mechanisms, completely different and incompa...
Franklin Reynolds
COOPIS
2004
IEEE
15 years 10 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 7 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
PVLDB
2008
110views more  PVLDB 2008»
15 years 5 months ago
DObjects: enabling distributed data services for metacomputing platforms
Many applications rely heavily on large amounts of data in the distributed storages collected over time or produced by large scale scientific experiments or simulations. The key co...
Pawel Jurczyk, Li Xiong