Sciweavers

33 search results - page 2 / 7
» On Trip Planning Queries in Spatial Databases
Sort
View
GIS
2008
ACM
14 years 6 months ago
The multi-rule partial sequenced route query
Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number...
Haiquan Chen, Wei-Shinn Ku, Min-Te Sun, Roger Zimm...
GIS
2007
ACM
13 years 9 months ago
Pipelined spatial join processing for quadtree-based indexes
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
Walid G. Aref
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 9 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ICDE
2011
IEEE
288views Database» more  ICDE 2011»
12 years 9 months ago
Optimal location queries in road network databases
— Optimal location (OL) queries are a type of spatial queries particularly useful for the strategic planning of resources. Given a set of existing facilities and a set of clients...
Xiaokui Xiao, Bin Yao 0002, Feifei Li
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
14 years 5 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald