Sciweavers

12 search results - page 2 / 3
» Closest Pair Queries with Spatial Constraints
Sort
View
GIS
2006
ACM
14 years 5 months 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...
VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 9 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
ICDE
2009
IEEE
210views Database» more  ICDE 2009»
14 years 6 months ago
Keyword Search in Spatial Databases: Towards Searching by Document
This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive inf...
Dongxiang Zhang, Yeow Meng Chee, Anirban Mondal, A...
ISCI
2007
141views more  ISCI 2007»
13 years 4 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
TKDE
2011
168views more  TKDE 2011»
12 years 11 months ago
On Computing Farthest Dominated Locations
—In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p , ...
Hua Lu, Man Lung Yiu