13457 search results - page 2519 / 2692 » Design and Development of the Long-Jumping |
181
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
205
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...
203
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
217
Voted
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
177
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...