Products

range aggregate processing in spatial databases

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

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 spatial databases

2020-11-11 · range aggregate processing spatial databases. There are forty years of manufacturing history, with three major production bases,over 160 senior R&D engineers and 600+ large and medium-sized digital processing equipment, The first-line technicians and professional after-sales service personnel up to 2,300+ and 200+ respectively.

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

CiteSeerX — Predicted Range Aggregate Processing

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

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

(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

A Scalable Algorithm for Maximizing Range Sum in

2018-6-11 · spatial preference queries . In this paper, we solve the maximizing range sum (MaxRS ) problem in spatial databases. Given a set O of weighted points (a.k.a. objects) and a rectangle r of a given size, the goal of the MaxRS problem is to nd a location of r which maximizes the sum of the weights of all the objects covered by r.

More

Range Aggregate Processing in Spatial Databases

Range Aggregate Processing in Spatial Databases . By Yufei Tao and Dimitris Papadias. Abstract. 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

More

Predicted Range Aggregate Processing In Spatio

range aggregate processing spatial databases. 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).

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

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 approximate aggregate range

More

Indexing range sum queries in spatio-temporal

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

Aggregate Analytic Window Query over Spatial Data

2020-7-31 · aggregate analytic window query over spatial data and propose techniques to answer the query in spatial databases with different indexes, such as grids and quadtree. Different various types of aggregate analytic queries may have different aggregate functions.

More

aggregate query processing in peer to peer networks

Range of Query Processing in Peer to Peer . Peer to peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, such as aggregation queries, these databases poses unique challenges.

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

A Scalable Algorithm for Maximizing Range Sum in

2018-6-11 · spatial preference queries . In this paper, we solve the maximizing range sum (MaxRS ) problem in spatial databases. Given a set O of weighted points (a.k.a. objects) and a rectangle r of a given size, the goal of the MaxRS problem is to nd a location of r which maximizes the sum of the weights of all the objects covered by r.

More