Sciweavers

1430 search results - page 19 / 286
» Query operations for moving objects database systems
Sort
View
DEXA
2000
Springer
99views Database» more  DEXA 2000»
13 years 12 months ago
The BORD Benchmark for Object-Relational Databases
This paper describes a new benchmark for object-relational DBMSs, the Benchmark for Object-Relational Databases (BORD). BORD has been developed to evaluate system performance pecul...
Sang Ho Lee, Sung Jin Kim, Won Kim
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 9 months ago
Venn Sampling: A Novel Prediction Technique for Moving Objects
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...
Yufei Tao, Dimitris Papadias, Jian Zhai, Qing Li
INFOSCALE
2009
ACM
14 years 8 days ago
CAWA: Continuous Approximate Where-About Queries
With the current proliferation of wireless networks and mobile device technologies, the management of moving object databases to facilitate queries over these domains has been exte...
Alexander J. Aved, Kien A. Hua, Antoniya Petkova
JMLC
1997
Springer
13 years 11 months ago
An Object-Oriented Database Programming Environment for Oberon
Abstract. We describe a system designed to provide database programming support for Oberon programmers. The system is based on a generic object-oriented data model which supports r...
Jacques Supcik, Moira C. Norrie
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 1 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...