Sciweavers

2514 search results - page 110 / 503
» On the Computation of Approximations of Database Queries
Sort
View
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
15 years 8 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
16 years 7 months ago
Efficient Computation of Subqueries in Complex OLAP
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...
Michael H. Böhlen, Michael O. Akinde
ACIVS
2006
Springer
16 years 12 days ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 12 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
DEXA
2009
Springer
201views Database» more  DEXA 2009»
16 years 1 months ago
Dynamic Query Processing for P2P Data Services in the Cloud
With the trend of cloud computing, data and computing are moved away from desktop and are instead provided as a service from the cloud. Data-as-a-service enables access to a wealth...
Pawel Jurczyk, Li Xiong