Sciweavers

301 search results - page 33 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
105
Voted
DLOG
2008
15 years 1 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
16 years 23 days ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
AIPS
1996
15 years 10 days ago
Building a Planner for Information Gathering: A Report from the Trenches
Informationgathering requires locating and integrating data froma set of distributed informationsources. These sources maycontain overlapping data and can comefrom different types...
Craig A. Knoblock
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
16 years 23 days ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
CCCG
2009
15 years 4 days ago
Data Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
Saladi Rahul, Prosenjit Gupta, K. S. Rajan