613 search results - page 66 / 123 » Query Evaluation on a Database Given by a Random Graph |
124
Voted
PVLDB
2010
15 years 2 months ago
2010
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
245
Voted
GIS
2005
ACM
16 years 4 months ago
2005
ACM
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
125
Voted
ECCC
2000
15 years 3 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
221
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
229
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
Given a region qR and a future timestamp qT, a "range aggregate" query estimates the number of objects expected to appear in qR at time qT. Currently the only methods fo...