range aggregate processing spatial databasesri
range aggregate processing spatial databasesri
Zhengzhou, Henan China
24 hours At your service

range aggregate processing spatial databasesri

  • Home
  • / Product
  • / range aggregate processing spatial databasesri

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

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

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

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

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

range aggregate processing in spatial da ases

CiteSeerX — Range Aggregate Processing in Spatial DatabasesCiteSeerX Range aggregate queries [7] apply an aggregation SQL operator, eg, SUM, over a set of selected contiguous ranges in the domains of the dimensional attribut Usually, such queries are resource intensive as they have high computational overheads in terms of temporal and spatial needs.Range Aggregate Processing in Spatial ...

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

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.

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

A high dynamic range camera provides the processing unit with image data. Measurement points of lane borders, calculated by a robust edge detection algorithm, are used to estimate a 3D clothoid ...

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

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

Efficient Maximum Range Search on Remote Spatial Databases ...

Jan 01, 2013  The latter [16] proposes two range query processing algorithms that use k-NN searches. However, our algorithm differs from theirs in that it deals with aggregate range queries by using k-NN searches, while theirs don’t deal with queries of this type. 3. Preliminaries Aggregate range queries are an extension of range queries [8], [9], [10].

range aggregate processing in spatial da ases

CiteSeerX — Range Aggregate Processing in Spatial DatabasesCiteSeerX Range aggregate queries [7] apply an aggregation SQL operator, eg, SUM, over a set of selected contiguous ranges in the domains of the dimensional attribut Usually, such queries are resource intensive as they have high computational overheads in terms of temporal and spatial needs.Range Aggregate Processing in Spatial ...

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.

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.

CRB-Tree: An Efficient Indexing Scheme for Range

temporal range-aggregate problem, studied in [21,22], we are given a set of (time) intervals in * and the goal is to compute an aggregation over the set of intervals that intersect a query rectangle; see Figure 1(iii). The range-aggregate problem is a special case of the temporal range-aggregate problem, which in turn is a special case of the

A class of R-tree histograms for spatial databases DeepDyve

Nov 06, 2012  A class of R-tree histograms for spatial databases Daniar Achakeev Department of Mathematics and Computer Science Philipps-Universität Marburg, Germany Bernhard Seeger Department of Mathematics and Computer Science Philipps-Universität Marburg, Germany [email protected] [email protected] ABSTRACT Spatial

Parallel databases - SlideShare

Dec 13, 2014  – multimedia objects like images are increasingly stored in databases • Large-scale parallel database systems increasingly used for: – storing large volumes of data – processing time-consuming decision-support queries – providing high throughput for transaction processing

Approximately processing aggregate range queries on remote ...

Jan 01, 2013  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 search aggregate range query results over remote spatial ...

Spatio-temporal access methods: a survey (2010 - 2017 ...

Oct 09, 2018  The volume of spatio-temporal data is growing at a rapid pace due to advances in location-aware devices, e.g., smartphones, and the popularity of location-based services, e.g., navigation services. A number of spatio-temporal access methods have been proposed to support efficient processing of queries over the spatio-temporal data. Spatio-temporal access methods can be

Recovering Information from Summary Data

tistical databases. The mathematical problem formu- lation is given in Section 3. In Section 4 we present a brief introduction to the theory of inverse problems and some proposed solutions for database settings. In particular, our central Theorem regarding information recovery from aggregate data is established.

Producer Suite - GEO Data Design

The Producer Suite empowers you to collect, process, analyze and understand raw geospatial data, and ultimately deliver usable information. This includes Hexagon Geospatial’s desktop-based GIS, remote sensing and photogrammetry offerings. ERDAS ER Mapper is a powerful, yet simple to use geospatial imagery processing application. This solution enhances your geographic data to make it 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 efficiently processing these queries is required. This paper applies Regular Polygon based Search Algorithm (RPSA)toefficiently searching approximate aggregate range

Range-aggregate query problems involving geometric ...

Spatial Databases: A Tour. Prentice Hall. Google Scholar {13} SHERWANI, N. 1998. Algorithms for VLSI Physical Design Automation. Kluwer Academic. Google Scholar Digital Library {14} TAO, Y. AND PAPADIAS, D. 2004. Range aggregate processing in spatial databases. IEEE Transactions on Knowledge and Data Engineering 16, 12, 1555-1570.

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

Spatial Analytics with Oracle Database 19c

Oracle’s spatial capabilities are part of the database kernel, and geospatial deployments natively harness Oracle Database features for scalability, security, partitioning, and parallelism. They reduce application logic and support real world analysis by moving complex spatial logic into the database. The processing

Spatial aggregation: Data model and implementation ...

Data aggregation in Geographic Information Systems (GIS) is a desirable feature, only marginally present in commercial systems nowadays, mostly through ad hoc solutions. We address this problem introducing a formal model that integrates, in a natural way, geographic data and non-spatial information contained in a data warehouse external to the GIS.

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

Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric.

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

Utilizing Voronoi Cells of Location Data Streams for ...

With our spatial aggregation operators, the sensor measurements of sparse areas (e.g., s 1 in Figure 1) contribute more to the final result as compared to those of dense areas. That is, the spatial average operator relies on the value of the node s 1 more than that of s 4 with two other nearby measurements. As of traditional aggregate ...

1 A Link-Based Storage Scheme for Efficient Aggregate

Efficient Aggregate Query Processing on Clustered Road Networks Engin Demir, Cevdet Aykanat, B. Barla Cambazoglu Abstract The need to have efficient storage schemes for spatial networks is apparent when the volume of query processing in some road networks (e.g., the navigation systems) is considered. Specifically, under the assumption that ...

INTERNATIONAL JOURNAL OF COMPUTER SCIENCE

Range queries, as one of the most commonly used tools, are often posed by the users to retrieve needful information from a spatial database. However, due to the limits of communication bandwidth and hardware power of handheld devices, displaying all the results of a range query on a handheld device is neither communication efficient nor ...

also aggregate data for query processing and the siz

Range aggregate processing in spatial databases - ResearchGate In this paper, we consider range count queries on multi-dimensional data points, where the result is the size of R (e.g., the number of hotels in an areaAggregate processing of multi-dimensional objects has also been studied theoretically, leading to several interesting results ...

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.

aCN-RB-tree: constrained network-based index for spatio ...

Oct 01, 2009  So, search processing in the non-leaf nodes of the aRB-tree is needed. The proposed index showed almost the same performance as the FNR-tree and also supported the aggregation value with direction. In summary, the aCN-RB-tree shows good performance in range query (both temporal and spatial).

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.