Sciweavers

525 search results - page 76 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
15 years 8 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou
235
Voted
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
16 years 4 months ago
Probabilistic Message Passing in Peer Data Management Systems
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
Philippe Cudré-Mauroux, Karl Aberer, Andras...
SIGMOD
2008
ACM
134views Database» more  SIGMOD 2008»
16 years 3 months ago
SystemT: a system for declarative information extraction
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghava...
124
Voted
FOCS
2008
IEEE
15 years 10 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx
136
Voted
IS
2007
15 years 3 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki