Sciweavers

2850 search results - page 59 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
121
Voted
CIKM
2008
Springer
15 years 3 months ago
Aggregate queries over ontologies
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Ca...
SSDBM
2003
IEEE
196views Database» more  SSDBM 2003»
15 years 7 months ago
Stream Window Join: Tracking Moving Objects in Sensor-Network Databases
The widespread use of sensor networks presents revolutionary opportunities for life and environmental science applications. Many of these applications involve continuous queries t...
Moustafa A. Hammad, Walid G. Aref, Ahmed K. Elmaga...
115
Voted
DBPL
2005
Springer
130views Database» more  DBPL 2005»
15 years 7 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
106
Voted
DEXAW
2005
IEEE
156views Database» more  DEXAW 2005»
15 years 7 months ago
Fixing Inconsistent Databases by Updating Numerical Attributes
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
DKE
2006
123views more  DKE 2006»
15 years 1 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...