Sciweavers

184 search results - page 8 / 37
» Efficient Range Query Retrieval for Non-Uniform Data Distrib...
Sort
View
ITCC
2005
IEEE
15 years 3 months ago
Design Theoretic Approach to Replicated Declustering
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Most of the research on declustering is targeted at spatial r...
Ali Saman Tosun
ESCIENCE
2007
IEEE
15 years 1 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
15 years 9 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
HPDC
2003
IEEE
15 years 2 months ago
Flexible Information Discovery in Decentralized Distributed Systems
The ability to efficiently discover information using partial knowledge (for example keywords, attributes or ranges) is important in large, decentralized, resource sharing distri...
Cristina Schmidt, Manish Parashar
DBISP2P
2004
Springer
162views Database» more  DBISP2P 2004»
15 years 2 months ago
CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications
Distributed Hash Tables (DHTs) have been widely adopted in many Internet-scale P2P systems. Emerging P2P applications such as massively multi player online games (MMOGs) and P2P ca...
Jinwon Lee, Hyonik Lee, Seungwoo Kang, Sungwon Pet...