Sciweavers

320 search results - page 33 / 64
» A Theory of Spatio-Temporal Database Queries
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 3 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 9 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
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 8 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
14 years 10 months ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
14 years 9 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...