Sciweavers

2514 search results - page 76 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
14 years 9 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
MOBIDE
2006
ACM
16 years 9 days ago
Evaluation of probabilistic queries in moving objects databases
The representation of moving objects in spatial database systems has become an important research topic in recent years. As it is not realistic to track and store the location of ...
Talel Abdessalem, Laurent Decreusefond, José...
CL
2000
Springer
15 years 10 months ago
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
Marcelo Arenas, Leopoldo E. Bertossi, Michael Kife...
ICSE
2005
IEEE-ACM
16 years 6 months ago
Safe query objects: statically typed objects as remotely executable queries
When building scalable systems that involve general-purpose computation and persistent data, object-oriented languages and relational databases are often essential components. Yet...
William R. Cook, Siddhartha Rai
DCG
2010
289views more  DCG 2010»
15 years 6 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...