TY - JOUR
T1 - Object-based directional query processing in spatial databases
AU - Liu, Xuan
AU - Shekhar, Shashi
AU - Chawla, Sanjay
N1 - Funding Information:
This work is sponsored in part by the Army High Performance Computing Research Center under the auspices of the US Department of the Army, Army Research Laboratory cooperative agreement number DAAH04-95-2-003/contract number DAAH04-95-C-0008, the content of which does not necessarily reflect the position or the policy of the government and no official edorsement should be inferred.
PY - 2003/3
Y1 - 2003/3
N2 - Direction-based spatial relationships are critical in many domains, including geographic information systems (GIS) and image interpretation. They are also frequently used as selection conditions in spatial queries. In this paper, we explore the processing of object-based direction queries and propose a new open shape-based strategy (OSS). OSS models the direction region as an open shape and converts the processing of the direction predicates into the processing of topological operations between open shapes and closed geometry objects. The proposed strategy OSS makes it unnecessary to know the boundary of the embedding world and also eliminates the computation related to the world boundary. OSS reduces both I/O and CPU costs by greatly improving the filtering effectiveness. Our experimental evaluation shows that OSS consistently outperforms classical range query strategies (RQS) while the degree of performance improvement varies by several parameters. Experimental results also demonstrate that OSS is more scalable than RQS for large data sets.
AB - Direction-based spatial relationships are critical in many domains, including geographic information systems (GIS) and image interpretation. They are also frequently used as selection conditions in spatial queries. In this paper, we explore the processing of object-based direction queries and propose a new open shape-based strategy (OSS). OSS models the direction region as an open shape and converts the processing of the direction predicates into the processing of topological operations between open shapes and closed geometry objects. The proposed strategy OSS makes it unnecessary to know the boundary of the embedding world and also eliminates the computation related to the world boundary. OSS reduces both I/O and CPU costs by greatly improving the filtering effectiveness. Our experimental evaluation shows that OSS consistently outperforms classical range query strategies (RQS) while the degree of performance improvement varies by several parameters. Experimental results also demonstrate that OSS is more scalable than RQS for large data sets.
KW - Object-based direction query
KW - Open shape
KW - Range query
KW - Spatial query processing
UR - http://www.scopus.com/inward/record.url?scp=0037342309&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2003.1185835
DO - 10.1109/TKDE.2003.1185835
M3 - Article
AN - SCOPUS:0037342309
VL - 15
SP - 295
EP - 304
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
SN - 1041-4347
IS - 2
ER -