Sciweavers

33 search results - page 4 / 7
» On Trip Planning Queries in Spatial Databases
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 13 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DKE
2006
123views more  DKE 2006»
13 years 7 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
WWW
2003
ACM
14 years 8 months ago
High-performance spatial indexing for location-based services
Much attention has been accorded to Location-Based Services and location tracking, a necessary component in active, trigger-based LBS applications. Tracking the location of a larg...
Jussi Myllymaki, James H. Kaufman
GIS
2004
ACM
14 years 8 months ago
An abstract model of three-dimensional spatial data types
act Model of Three-Dimensional Spatial Data Types Markus Schneider & Brian E Weinrich University of Florida Department of Computer & Information Science & Engineering G...
Markus Schneider, Brian E. Weinrich
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray