Sciweavers

11 search results - page 1 / 3
» SkipTree: A Scalable Range-Queryable Distributed Data Struct...
Sort
View
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
13 years 10 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
ICC
2007
IEEE
116views Communications» more  ICC 2007»
13 years 11 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...
WDAS
2000
13 years 6 months ago
Scalable Distributed Data Structures: A Survey
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given s...
Adriano Di Pasquale, Enrico Nardelli
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
13 years 9 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
PPOPP
2011
ACM
12 years 7 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...