Sciweavers

214 search results - page 22 / 43
» Foundations of probabilistic answers to queries
Sort
View
ICDE
2007
IEEE
158views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Evaluation of Imprecise Location-Dependent Queries
In location-based services, it is common for a user to issue a query based on his/her current position. One such example is "find the available cabs within two miles of my cu...
Jinchuan Chen, Reynold Cheng
COMPGEOM
2010
ACM
14 years 1 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 8 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
ICLP
2010
Springer
14 years 11 days ago
Dedicated Tabling for a Probabilistic Setting
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a...
Theofrastos Mantadelis, Gerda Janssens
VLDB
1997
ACM
86views Database» more  VLDB 1997»
14 years 18 days ago
Using Probabilistic Information in Data Integration
The goal of a mediator system is to provide users a uniform interface to the multitude of information sources. To translate user queries, given in a mediated schema, to queries on...
Daniela Florescu, Daphne Koller, Alon Y. Levy