Dawn Broken company Bienvenue, 24h / 24 à votre service

Home>Produit>range aggregate processing spatial databases

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

More

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

More

Range aggregate processing in spatial databases - 百度学术

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

More

CiteSeerX — Range Aggregate Processing in Spatial

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

More

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA

2005-3-25  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

More

range aggregate processing in spatial databases

Range aggregate processing in spatial databases HKUST PDF Range aggregate processing in spatial databases. Authors Tao Y Papadias D Issue Date Source IEEE transactions on knowledge and data engineering v 16 12 DEC p SummaryA range aggregate query returns summarized information about the points falling in a hyper rectangle eg the total number of these points instead of their concrete ids

More

Range Aggregate Processing In Spatial Databases

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

More

Predicted range aggregate processing in spatio-temporal ...

2006-7-31  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

More

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

More

A Scalable Algorithm for Maximizing Range Sum in

2017-6-30  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

More

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

More

Predicted range aggregate processing in spatio-temporal ...

2006-7-31  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

More

Article: Approximately processing aggregate range queries ...

2014-4-7  Abstract: Processing aggregate range queries on remote spatial databases suffers from accessing huge and/or large number of databases that operate autonomously and simple and/or restrictive web API interfaces. To overcome these difficulties, this paper applies a revised version of regular polygon-based search algorithm (RPSA) to approximately ...

More

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-

More

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

2007-4-1  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.

More

Efficient Maximum Range Search on Remote Spatial

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

More

Supporting Spatial Aggregation in Sensor Network

2016-5-21  network processing of the aggregation queries on the data generated in the sensor network. We use the ad-hoc query routing algorithm of TAG to disseminate our query into the network. Our spatial aggregate operators are compatible with the aggregate processing of TAG and easily portable to TinyDB. Zhao et al. in [9] introduce an architecture for ...

More

(PDF) Moving Range Query Processing in Spatial Databases

Different types of spatial queries are used in such applications, however, most studies consider the moving range query to be the most common, and frequently used.

More

Efficient Maximum Range Search on Remote Spatial

2017-1-18  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

More

Aggregate Nearest Neighbor Queries in Spatial Databases

2005-8-29  Aggregate Nearest Neighbor Queries in Spatial Databases • 533 Fig. 3. DF NN algorithm. by N 1 and N 4, where the first potential nearest neighbor is found (p 5).During backtracking to the upper level (node N 1), the algorithm prunes entries whose mindist is equal to or larger than the distance (best dist)ofthe nearest neigh- bor already retrieved.

More

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

More

CiteSeerX — Predicted Range Aggregate Processing in

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

More

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-

More

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

2007-4-1  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.

More

(PDF) Moving Range Query Processing in Spatial

Different types of spatial queries are used in such applications, however, most studies consider the moving range query to be the most common, and frequently used.

More

Clustering spatial networks for aggregate query

2013-2-25  models, spatial access methods, and query processing techniques are proposed [1,2] to overcome the problems faced within the extensive scale of geo-graphic information systems (GIS). The increasing demand on geographic applications made spatial databases quite popular. The research on spatial databases focused on the Euclidean space, where the

More

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 e ffi ciently processing these queries is required.

More

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

More

Supporting spatial aggregation in sensor network databases

Our spatial aggregate operators are compatible as the primary keys. with the aggregate processing of TAG and easily portable A set of different aggregation queries are now formally to TinyDB. definable on the the realized conceptual model of the sensor Zhao et al. in

More

Aggregate Nearest Neighbor Queries in Spatial Databases

2005-8-29  Aggregate Nearest Neighbor Queries in Spatial Databases • 533 Fig. 3. DF NN algorithm. by N 1 and N 4, where the first potential nearest neighbor is found (p 5).During backtracking to the upper level (node N 1), the algorithm prunes entries whose mindist is equal to or larger than the distance (best dist)ofthe nearest neigh- bor already retrieved.

More

CiteSeerX — Predicted Range Aggregate Processing in

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

More

range aggregate processing in spatial databases

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

More

(PDF) Moving Range Query Processing in Spatial

With mobile moving range queries, there is a need to recalculate the relevant surrounding objects of interest whenever the query moves. Therefore, monitoring the moving query is very costly.

More

Range and region query processing in spatial databases -

Because of the importance of the spatial queries, a mass of researches concentrated on processing various queries in spatial databases, especially, for k nearest neighbors (kNN) queries and its variations. However, as the fundamental query in spatial databases,

More

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 e ffi ciently processing these queries is required.

More

Supporting spatial aggregation in sensor network

2004-11-12  Literature on spatial databases also mainly focus on modelling issues, the class of nearest neighbor queries and index structures to provide fast answers to the queries [2]. Meanwhile, the research work on aggregate processing in wireless sensor networks is

More

Materialized views for count aggregates of spatial data ...

title = "Materialized views for count aggregates of spatial data", abstract = "We address the problem of efficient processing of count aggregate queries for spatial objects in OLAP systems. One of the main issues affecting the efficient spatial analysis is the, so called, distinct counting problem. The core of the problem is due to the fact ...

More

Algorithms for Fundamental Spatial Aggregate

2020-3-10  Aggregate operations have a long history of use and study in databases (see the survey [11]). The development of spa-tial aggregates is more recent, but has similarly received much attention. A signi cant portion of the literature on spatial aggregates is devoted to mechanisms to support range queries, or box queries. Aggregate range queries ...

More

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

More

INDEXING AND QUERY PROCESSING TECHNIQUES IN

2019-7-30  databases, which derive from spatial databases and temporal databases. The difference is that moving objects databases focus ... updating query, range based query, trajectory queries for moving objects and uncertain past, present and future data detection ... Skyline Probability Top-K Nearest Aggregate Incomplete Past, Present, Future.

More
© Copyright © 2013.Dawn Broken All rights reserved.Dawn Broken