Sciweavers

51 search results - page 9 / 11
» Computing consistent query answers using conflict hypergraph...
Sort
View
DKE
2007
153views more  DKE 2007»
13 years 6 months ago
Adaptive similarity search in streaming time series with sliding windows
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
PVLDB
2010
120views more  PVLDB 2010»
13 years 4 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab
ICALP
2004
Springer
13 years 11 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
CIKM
1999
Springer
13 years 10 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
GRAPHITE
2007
ACM
13 years 10 months ago
Visibility map for global illumination in point clouds
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
Rhushabh Goradia, Anil Kanakanti, Sharat Chandran,...