Sciweavers

932 search results - page 116 / 187
» Where in the Wikipedia Is That Answer
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
14 years 8 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
PODS
2003
ACM
118views Database» more  PODS 2003»
14 years 8 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 8 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 7 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
ICDE
2010
IEEE
874views Database» more  ICDE 2010»
14 years 7 months ago
UV-Diagram: A Voronoi Diagram for Uncertain Data
The Voronoi diagram is an important technique for answering nearest-neighbor queries for spatial databases. In this paper, we study how the Voronoi diagram can be used on uncertain...
Reynold Cheng, Xike Xie, Man Lung Yiu, Jinchuan Ch...