Sciweavers

52 search results - page 4 / 11
» Optimization of continuous queries with shared expensive fil...
Sort
View
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
14 years 10 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 2 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
PVLDB
2010
172views more  PVLDB 2010»
13 years 7 months ago
Database-support for Continuous Prediction Queries over Streaming Data
Prediction is emerging as an essential ingredient for real-time monitoring, planning and decision support applications such as intrusion detection, e-commerce pricing and automate...
Mert Akdere, Ugur Çetintemel, Eli Upfal
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
12 years 11 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
VLDB
1998
ACM
111views Database» more  VLDB 1998»
14 years 22 days ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...