Sciweavers

346 search results - page 35 / 70
» Towards Declarative Queries on Adaptive Data Structures
Sort
View
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
SD-Rtree: A Scalable Distributed Rtree
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
Cédric du Mouza, Philippe Rigaux, Witold Li...
CIKM
2005
Springer
14 years 1 months ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
AAAI
2008
13 years 10 months ago
Adapting ADtrees for High Arity Features
ADtrees, a data structure useful for caching sufficient statistics, have been successfully adapted to grow lazily when memory is limited and to update sequentially with an increme...
Robert Van Dam, Irene Langkilde-Geary, Dan Ventura
ICDE
2005
IEEE
124views Database» more  ICDE 2005»
14 years 1 months ago
SemCrypt - Ensuring Privacy of Electronic Documents Through Semantic-Based Encrypted Query Processing
The trend towards outsourcing increases the number of documents stored at external service providers. This storage model, however, raises privacy and security concerns because the...
Michael Schrefl, Katharina Grün, Jürgen ...
XIMEP
2005
ACM
121views Database» more  XIMEP 2005»
14 years 1 months ago
Adaptive XML Storage or The Importance of Being Lazy
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...
Cristian Duda, Donald Kossmann