Sciweavers

1890 search results - page 232 / 378
» Querying Big Data by Accessing Small Data
Sort
View
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
15 years 11 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 3 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
15 years 4 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
SISW
2003
IEEE
15 years 4 months ago
Implementation of a Storage Mechanism for Untrusted DBMSs
Several architectures have been recently proposed that store relational data in encrypted form on untrusted relational databases. Such architectures permit the creation of novel I...
Ernesto Damiani, Sabrina De Capitani di Vimercati,...
SSD
1999
Springer
99views Database» more  SSD 1999»
15 years 3 months ago
Algorithms for Joining R-Trees and Linear Region Quadtrees
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...