Sciweavers

168 search results - page 16 / 34
» Incremental Distance Join Algorithms for Spatial Databases
Sort
View
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 8 months ago
Continuous obstructed nearest neighbor queries in spatial databases
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...
Yunjun Gao, Baihua Zheng
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 8 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
VLDB
1998
ACM
112views Database» more  VLDB 1998»
14 years 3 days ago
Incremental Clustering for Mining in a Data Warehousing Environment
Data warehouses provide a great deal of opportunities for performing data mining tasks such as classification and clustering. Typically, updates are collected and applied to the d...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
14 years 9 months ago
Evaluation of Spatio-Temporal Predicates on Moving Objects
Moving objects databases managing spatial objects with continuously changing position and extent over time have recently found large interest in the database community. Queries ab...
Markus Schneider
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 11 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim