Sciweavers

282 search results - page 33 / 57
» Merging Databases Under Constraints
Sort
View
DEBS
2011
ACM
14 years 6 months ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke
GIS
1997
ACM
15 years 6 months ago
Speeding up Bulk-Loading of Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve...
Gísli R. Hjaltason, Hanan Samet, Yoram J. S...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 3 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SIGIR
2006
ACM
15 years 8 months ago
Hybrid index maintenance for growing text collections
We present a new family of hybrid index maintenance strategies to be used in on-line index construction for monotonically growing text collections. These new strategies improve up...
Stefan Büttcher, Charles L. A. Clarke, Brad L...
PODS
2005
ACM
130views Database» more  PODS 2005»
16 years 3 months ago
Composition of mappings given by embedded dependencies
Composition of mappings between schemas is essential to support schema evolution, data exchange, data integration, and other data management tasks. In many applications, mappings ...
Alan Nash, Philip A. Bernstein, Sergey Melnik