Sciweavers

734 search results - page 33 / 147
» Efficient join processing over uncertain data
Sort
View
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
15 years 9 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
15 years 2 months ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi
SIGMOD
1997
ACM
113views Database» more  SIGMOD 1997»
15 years 1 months ago
Size Separation Spatial Join
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
Nick Koudas, Kenneth C. Sevcik
TKDE
2008
178views more  TKDE 2008»
14 years 9 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 10 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes