Sciweavers

253 search results - page 19 / 51
» Close pair queries in moving object databases
Sort
View
GIS
2006
ACM
16 years 25 days ago
Distance join queries on spatial networks
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
ICDE
2012
IEEE
291views Database» more  ICDE 2012»
13 years 11 months ago
Efficiently Monitoring Top-k Pairs over Sliding Windows
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, We...
DOOD
1995
Springer
128views Database» more  DOOD 1995»
15 years 3 months ago
Authorization Analysis of Queries in Object-Oriented Databases
Abstract. A simple model for method-based authorization is defined and an algorithm is presented for testing in compile-time whether a given database schema violates authorization...
Hiroyuki Seki, Yasunori Ishihara, Minoru Ito
JCST
2007
151views more  JCST 2007»
14 years 11 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng
DEXA
2008
Springer
85views Database» more  DEXA 2008»
15 years 1 months ago
Reordering of Location Identifiers for Indexing an RFID Tag Object Database
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...
Sungwoo Ahn, Bonghee Hong