Sciweavers

173 search results - page 25 / 35
» Range queries in dynamic OLAP data cubes
Sort
View
ESCIENCE
2007
IEEE
13 years 11 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
VLDB
2005
ACM
124views Database» more  VLDB 2005»
14 years 29 days ago
Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions
In an “uncertain database”, an object o is associated with a multi-dimensional probability density function (pdf), which describes the likelihood that o appears at each positi...
Yufei Tao, Reynold Cheng, Xiaokui Xiao, Wang Kay N...
JEA
2008
112views more  JEA 2008»
13 years 7 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
GEOINFORMATICA
2006
103views more  GEOINFORMATICA 2006»
13 years 7 months ago
Building and Querying a P2P Virtual World
Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment. One peer is introduced to the system by each participant. However current P2P app...
Egemen Tanin, Aaron Harwood, Hanan Samet, Deepa Na...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray