Sciweavers

2635 search results - page 299 / 527
» Algorithms for the Database Layout Problem
Sort
View
ICDE
1998
IEEE
147views Database» more  ICDE 1998»
16 years 8 months ago
The Effect of Buffering on the Performance of R-Trees
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...
Scott T. Leutenegger, Mario A. Lopez
KDD
2006
ACM
166views Data Mining» more  KDD 2006»
16 years 7 months ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
VLDB
2001
ACM
107views Database» more  VLDB 2001»
16 years 6 months ago
A survey of approaches to automatic schema matching
Schema matching is a basic problem in many database application domains, such as data integration, Ebusiness, data warehousing, and semantic query processing. In current implementa...
Erhard Rahm, Philip A. Bernstein
VLDB
2003
ACM
123views Database» more  VLDB 2003»
16 years 6 months ago
A case for fractured mirrors
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
Ravishankar Ramamurthy, David J. DeWitt, Qi Su
ICDT
2010
ACM
180views Database» more  ICDT 2010»
16 years 4 months ago
Foundations of SPARQL Query Optimization
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
Michael Schmidt, Michael Meier, Georg Lausen