Sciweavers

735 search results - page 78 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
IIS
2003
15 years 1 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
VLDB
2005
ACM
112views Database» more  VLDB 2005»
15 years 5 months ago
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks
This paper presents a set of algorithms for efficiently evaluating join queries over static data tables in sensor networks. We describe and evaluate three algorithms that take adv...
Daniel J. Abadi, Samuel Madden, Wolfgang Lindner
ER
2008
Springer
110views Database» more  ER 2008»
15 years 1 months ago
Conjunctive Query Containment under Access Limitations
Access limitations may occur when querying data sources over the web or heterogeneous data sources presented as relational tables: this happens, for instance, in Data Exchange and ...
Andrea Calì, Davide Martinenghi
DOLAP
2000
ACM
15 years 4 months ago
CUBIST: A New Algorithm For Improving the Performance of Ad-hoc OLAP Queries
Being able to efficiently answer arbitrary OLAP queries that aggregate along any combination of dimensions over numerical and categorical attributes has been a continued, major co...
Lixin Fu, Joachim Hammer
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 2 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny