+86 0371 8654 9132

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 ...

[PDF] Range aggregate processing in spatial databases ...

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 logarithmic cost to the data set cardinality (independently of the query size) for two ...

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 ...

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

[PDF] Range aggregate processing in spatial databases ...

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 logarithmic cost to the data set cardinality (independently of the query size) for two ...

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

Range aggregate processing in spatial databases - CORE

Range aggregate processing in spatial databases . By Yufei Tao and D. Papadias. Get PDF (1 MB) Cite . BibTex; Full citation; Publisher: 'Institute of Electrical and Electronics Engineers (IEEE)' DOI identifier: 10.1109/TKDE.2004.93. OAI identifier: Provided by: Crossref. Downloaded from http ...

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.

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-

Supporting Spatial Aggregation in Sensor Network Databases

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

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 ...

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 ...

Probabilistic Threshold Range Aggregate Query Processing ...

Recently, Yang et al [29] investigate the problem of range aggregate query processing over uncertain data in which two sampling approaches are proposed to estimate the aggregate values for the ...

CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate ...

One is the centralized solutions based for example on aggregation spatial query processing [13] [14][15], R-trees [5], or probability spatial join query processing with spatial sweep [16], but ...

Range-aggregate query problems involving geometric ...

We consider variations of the standard orthogonal range searching motivated by applications in database querying and VLSI layout processing. In a generic instance of such a problem, called a range-...

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.

Euler Histogram Tree: A Spatial Data Structure for ...

E.1 [Data]: Data structures; H.2.8 [Database applications]: Spa-tial databases and GIS General Terms Algorithms Keywords aggregate query, spatial histogram, hierarchical data structure 1. INTRODUCTION This paper addresses the problem of processing a variant of range queries in spatial databases for vehicle trajectories. More specifi-

USGS: Mineral Resources On-Line Spatial Data: earth ...

Provides links to USGS information about earth characteristics and related topics. Provides a topical browse interface into USGS information utilizing controlled vocabularies arranged as formal thesauri.

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 ...

CiteSeerX — Predicted Range Aggregate Processing in Spatio ...

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal databases. Recent studies have developed two major classes of PRA query methods: (1) accurate approaches, which search the common moving objects indexes to obtain an accurate result; and (2) estimate methods, which utilize ...

Article: Approximately processing aggregate range queries ...

Apr 07, 2014 · Title: Approximately processing aggregate range queries on remote spatial databases. Authors: Hideki Sato; Ryoichi Narita. Addresses: School of Informatics, Daido University, 10-3 Takiharu-cho, Minami-ku, Nagoya, 457-8530, Japan ' Aichi Toho University, 3-11 Heiwagaoka, Meito-ku, Nagoya, 465-8515, Japan

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

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 Databases ...

processing either k-ANN queries or aggregate range queries on remote spatial databases. In other words, a new strategy for e ffi ciently processing these queries is required.

Analyzing the performance of NoSQL vs. SQL databases for ...

an existing NoSQL database ’MongoDB’ with its inbuilt spatial functions with that of a SQL database with spatial extension ’PostGIS’ for two problems spatial and aggregate queries, across a range of datasets, with varying features counts. All the data in the analysis was processed In-memory and no secondary memory was used.

List of Papers and Books - Rutgers University

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 ...

Publications of Dimitris Papadias

Feb 06, 2010 · Tao, Y., Papadias, D. Range Aggregate Processing in Spatial Databases. IEEE Transactions on Knowledge and Data Engineering (TKDE), 16(12), 1555-1570, 2004.. ... D. Range Queries Involving Spatial Relations: A Performance Analysis. Proceedings of the 2 nd European Conference on Spatial Information Theory (COSIT), Semmering, Austria.

Spatial database - Wikipedia

A spatial database is a database 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 (triangulated irregular network).

Distributed Processing of Range Queries with Non-Spatial ...

Distributed Processing of Range Queries with Non-Spatial Selections DongEun Kim, HaRim Jung, GiWoong Nam, Hee Yong Youn and Ung-Mo Kim School of Information and Communication Engineering, Sungkyunkwan University 27309, 2066, Seobu-Ro, Jangan-Gu, Suwon, Gyeong gi-do, Korea [email protected], [email protected], [email protected], [email protected],

(PDF) Data Structures for Range-Aggregate Extent Queries ...

Data Structures for Range-Aggregate Extent Queries. 2008. Prosenjit Gupta. Download PDF. Download Full PDF Package. This paper. A short summary of this paper. 37 Full PDFs related to this paper. Read Paper. Data Structures for Range-Aggregate Extent Queries. Download. Related Papers.

Privacy-aware collection of aggregate spatial data | Data ...

Search ACM Digital Library. Search Search. Advanced Search

MRFM: An Efficient Approach to Spatial Join Aggregate ...

Aug 18, 2012 · Spatial join aggregate(SJA) is a commonly used but time-consuming operation in spatial database. Since it involves both the spatial join and the aggregate operation, performing SJA is a challenging task especially facing the deluge of spatial data. A popular model nowadays for massive data processing is the shared-nothing cluster using MapReduce.