Sciweavers

2883 search results - page 87 / 577
» Algorithms for merged indexes
Sort
View
VLDB
2007
ACM
116views Database» more  VLDB 2007»
14 years 4 months ago
K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization
In this paper we observe that k-anonymizing a data set is strikingly similar to building a spatial index over the data set, so similar in fact that classical spatial indexing tech...
Tochukwu Iwuchukwu, Jeffrey F. Naughton
CIKM
2004
Springer
14 years 3 months ago
Indexing text data under space constraints
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
Bijit Hore, Hakan Hacigümüs, Balakrishna...
DAC
2003
ACM
14 years 3 months ago
Improved indexing for cache miss reduction in embedded systems
The increasing use of microprocessor cores in embedded systems as well as mobile and portable devices creates an opportunity for customizing the cache subsystem for improved perfo...
Tony Givargis
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 10 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
APN
2007
Springer
14 years 4 months ago
Improving Static Variable Orders Via Invariants
Abstract. Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm ...
Gianfranco Ciardo, Gerald Lüttgen, Andy Jinqi...