range aggregate processing spatial databases
Welcome to the broken dawn

range aggregate processing spatial databases

Range Aggregate Processing in Spatial Databases

Range Aggregate Processing in Spatial Databases Yufei Tao Department of Computer Science City University of Hong Kong Tat Chee Avenue, Hong Kong [email protected] Dimitris Papadias Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong [email protected] Abstract

(PDF) Range aggregate processing in spatial databases

Range Aggregate Processing in Spatial Databases . Yufei Tao . ... Traditional research in spatial databases often aims at the range query, which retrieves the data . objects lying inside (or ...

CiteSeerX — Range Aggregate Processing in Spatial Databases

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract—A range aggregate query returns summarized information about the points falling in a hyper-rectangle (e.g., the total number of these points instead of their concrete ids). This paper studies spatial indexes that solve such queries efficiently and proposes the aggregate Point-tree (aP-tree), which achieves ...

A Scalable Algorithm for Maximizing Range Sum in Spatial ...

We first review the range aggregate processing methods in spatial databases. The range aggregate (RA) query was proposed for the scenario where users are interested in sum-marized information about objects in a given range rather than individual objects. Thus, a RA query returns an ag-gregation value over objects qualified for a given range. In

CiteSeerX — Range Aggregate Processing in Spatial Databases

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract—A range aggregate query returns summarized information about the points falling in a hyper-rectangle (e.g., the total number of these points instead of their concrete ids). This paper studies spatial indexes that solve such queries efficiently and proposes the aggregate Point-tree (aP-tree), which achieves ...

A Scalable Algorithm for Maximizing Range Sum in Spatial ...

We first review the range aggregate processing methods in spatial databases. The range aggregate (RA) query was proposed for the scenario where users are interested in sum-marized information about objects in a given range rather than individual objects. Thus, a RA query returns an ag-gregation value over objects qualified for a given range. In

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA

Range Aggregate Processing in Spatial Databases Yufei Tao and Dimitris Papadias Abstract—A range aggregate query returns summarized information about the points falling in a hyper-rectangle (e.g., the total number of these points instead of their concrete ids). This paper studies spatial indexes that solve such queries efficiently and

Range aggregate processing in spatial databases - CORE

Range aggregate processing in spatial databases . By null Yufei Tao and D. Papadias. Cite . BibTex; Full citation; Publisher: Institute of Electrical and Electronics Engineers (IEEE) Year: 2004. DOI identifier: 10.1109/tkde.2004.93. OAI identifier: Provided by: MUCC (Crossref ...

A Scalable Algorithm for Maximizing Range Sum in Spatial ...

W e first review the range aggregate processing methods. in spatial databases. The range aggregate (RA) query was. proposed for the scenario where users are interested in sum-

Efficient Maximum Range Search on Remote Spatial Databases ...

Jan 01, 2013  Supporting aggregate range queries on remote spatial databases suffers from 1) huge and/or large numbers of databases, and 2) limited type of access interfaces. This paper applies the Regular Polygon based Search Algorithm (RPSA) to effectively addressing these problems.

Algorithms for Fundamental Spatial Aggregate Operations ...

spatial aggregates is devoted to mechanisms to support range queries, or box queries. Aggregate range queries perform some aggregate operation over spatial or spatiotemporal data that fall into a user speci ed area (the range or box), pos-sibly over some speci ed time window [17, 10, 13]. Such aggregation mechanisms seem to stem from the ...

Indexing range sum queries in spatio-temporal databases ...

Apr 01, 2007  The R-tree is known to be one of the most popular index structures to efficiently process window queries in spatial databases. Intuitively, the aggregate R-tree (aR-tree) , improves the R-tree’s performance in range sum queries by storing, in each intermediate entry, pre-aggregated sums of the objects in the subtree. Fig. 1 shows an example of an aR-tree.

Supporting Spatial Aggregation in Sensor Network

of two different approaches to distributed spatial aggregate processing. Categories and Subject Descriptors H.2.8 [Database Management]: Database applications— Spatial Databases and GIS;H.2.4[DatabaseManagement]: Systems—Query processing, Distributed databases ∗This research is based upon work supported inpart by

(PDF) Query Processing in Spatial Databases Containing ...

Query Processing in Spatial Databases Containing Obstacles ... The aggregate travel distance can be measured in terms of the total, the maximum or the minimum travel distance of all group members ...

List of Papers and Books - Hui Xiong

Spatial Databases: Accomplishments and Research Needs, S. Shekhar , S ... "Range Aggregate Processing in Spatial Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 12, pp. 1555-1570, December, 2004. Haibo Hu, Dik Lun Lee. "Range Nearest-Neighbor Query," IEEE Transactions on Knowledge and Data Engineering ...

Probabilistic Threshold Range Aggregate Query Processing ...

Apr 02, 2009  A probabilistic threshold range aggregate (PTRA) query retrieves summarized information about the uncertain objects satisfying a range query, with respect to a given probability threshold. This paper is the first one to address this important type of query.

Spatial database - Wikipedia

A spatial database is a database that is optimized for storing and querying data that represents objects defined in a geometric space. Most spatial databases allow the representation of simple geometric objects such as points, lines and polygons. Some spatial databases handle more complex structures such as 3D objects, topological coverages, linear networks, and TINs.

Predicted range aggregate processing in spatio-temporal ...

Predicted Range Aggregate Processing in Spatio-temporal Databases Wei Liao, Guifen Tang, Ning Jing, Zhinong Zhong School of Electronic Science and Engineering, National University of Defense Technology Changsha, China [email protected] Abstract Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal ...

Predicted range aggregate processing in spatio-temporal ...

Predicted Range Aggregate Processing in Spatio-temporal Databases Wei Liao, Guifen Tang, Ning Jing, Zhinong Zhong School of Electronic Science and Engineering, National University of Defense Technology Changsha, China [email protected] Abstract Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal ...

Algorithms for Fundamental Spatial Aggregate Operations ...

spatial aggregates is devoted to mechanisms to support range queries, or box queries. Aggregate range queries perform some aggregate operation over spatial or spatiotemporal data that fall into a user speci ed area (the range or box), pos-sibly over some speci ed time window [17, 10, 13]. Such aggregation mechanisms seem to stem from the ...

A Scalable Algorithm for Maximizing Range Sum in Spatial ...

W e first review the range aggregate processing methods. in spatial databases. The range aggregate (RA) query was. proposed for the scenario where users are interested in sum-

Indexing range sum queries in spatio-temporal databases ...

Apr 01, 2007  The R-tree is known to be one of the most popular index structures to efficiently process window queries in spatial databases. Intuitively, the aggregate R-tree (aR-tree) , improves the R-tree’s performance in range sum queries by storing, in each intermediate entry, pre-aggregated sums of the objects in the subtree. Fig. 1 shows an example of an aR-tree.

Approximate range query processing in spatial network ...

Jul 20, 2012  Spatial range query is one of the most common queries in spatial databases, where a user invokes a query to find all the surrounding interest objects. Most studies in range search consider Euclidean distances to retrieve the result in low cost, but with poor accuracy (i.e., Euclidean distance less than or equal network distance). Thus, researchers show that range search in network distance ...

Efficient Maximum Range Search on Remote Spatial

processing either k-ANN queries or aggregate range queries on remote spatial databases. In other words, a new strategy for efficiently processing these queries is required. This paper applies Regular Polygon based Search Algorithm (RPSA)toefficiently searching approximate aggregate range

(PDF) Multiple Range Query Optimization in Spatial Databases

For multiple range query processing in spatial databases, Papadopoulos and Manolopoulos [21] first sort the queries based on their spatial similarities using a Space Filling Curve (SFC) and then ...

(PDF) Query Processing in Spatial Databases Containing ...

Query Processing in Spatial Databases Containing Obstacles ... The aggregate travel distance can be measured in terms of the total, the maximum or the minimum travel distance of all group members ...

List of Papers and Books - Hui Xiong

Spatial Databases: Accomplishments and Research Needs, S. Shekhar , S ... "Range Aggregate Processing in Spatial Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 12, pp. 1555-1570, December, 2004. Haibo Hu, Dik Lun Lee. "Range Nearest-Neighbor Query," IEEE Transactions on Knowledge and Data Engineering ...

Spatial database - Wikipedia

A spatial database is a database that is optimized for storing and querying data that represents objects defined in a geometric space. Most spatial databases allow the representation of simple geometric objects such as points, lines and polygons. Some spatial databases handle more complex structures such as 3D objects, topological coverages, linear networks, and TINs.

Supporting spatial aggregation in sensor network databases

Systems—Query processing, Distributed databases For example, the following query is a range aggregate query on a network of sensor nodes with humidity and temperature ∗This research is based upon work supported inpart by sensors: the National Science Foundation under award numbers IIS- SELECT AVG(humidity) 0324955(ITR), EEC-9529152 (IMSC ...

Yufei Tao's Publications - CUHK CSE

Range Aggregate Processing in Spatial Databases. IEEE Transactions on Knowledge and Data Engineering (TKDE), 16(12): 1555-1570, 2004. 2003 . Dimitris Papadias, Yufei Tao, Greg Fu, and Bernhard Seeger. An Optimal and Progressive Algorithm for Skyline Queries. Proceedings of ACM Conference on Management of Data (SIGMOD), pages 467-478, 2003. Long ...

Predicted Range Aggregate Processing in Spatio-temporal ...

Request PDF Predicted Range Aggregate Processing in Spatio-temporal Databases Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal databases. Recent ...

range aggregate abstract a - smartmods

-range aggregate processing spatial databases-Abstract. In a range-aggegate query problem we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain intersection or proximity query on the objects of S intersected by q can be answered efficiently.

Copyright © 2021.Company name All rights reserved.Dawn Broken