Sciweavers

1542 search results - page 35 / 309
» Redundancy in Spatial Databases
Sort
View
DKE
2002
113views more  DKE 2002»
13 years 7 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
13 years 12 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 7 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
COMPSAC
2004
IEEE
13 years 11 months ago
Mining Complex Relationships in the SDSS SkyServer Spatial Database
In this paper we describe the process of mining complex relationships in spatial databases using the Maximal Participation Index (maxPI), which has a property of discovering low s...
Bavani Arunasalam, Sanjay Chawla, Pei Sun, Robert ...
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 7 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis