Sciweavers

929 search results - page 111 / 186
» Answering imprecise database queries: a novel approach
Sort
View
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
15 years 5 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
WISE
2009
Springer
15 years 9 months ago
Web Queries: From a Web of Data to a Semantic Web
ct One significant effort towards combining the virtues of Web search, viz. being accessible to untrained users and able to cope with vastly heterogeneous data, with those of dat...
François Bry, Tim Furche, Klara A. Weiand
CIKM
2005
Springer
15 years 5 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
VLDB
2004
ACM
187views Database» more  VLDB 2004»
15 years 5 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
KDD
2007
ACM
186views Data Mining» more  KDD 2007»
16 years 8 days ago
An Ad Omnia Approach to Defining and Achieving Private Data Analysis
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
Cynthia Dwork