range aggregate processing in spatial databases

  • Yufei Tao''s Publications

    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.

  • IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, …

    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

  • Range aggregate processing in spatial databases

    Range aggregate processing in spatial databases Authors Tao, Y. Papadias, D. Issue Date 2004 Source IEEE transactions on knowledge and data engineering, v. 16, (12), 2004, DEC, p. 1555-1570 Summary A range aggregate query returns (e.g., the total ...

  • Analyzing the performance of NoSQL vs. SQL databases for Spatial and Aggregate …

    Analyzing the performance of NoSQL vs. SQL databases for Spatial and Aggregate queries Sarthak Agarwala,, KS Rajana aInternational Institute of Information Technology Hyderabad Gachibowli, Hyderabad, India Abstract: Relational databases have been around for

  • 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] .hk Dimitris Papadias Department of Computer Science Hong Kong University of

  • U of M CSCI 8715

    Selectivity Estimation in Spatial Databases Sridhar Ramaswamy Viswanath Poosala Information Sciences Research Center Bell Laboratories Lucent Technologies 600 … U of M CSCI 8715 - Selectivity Estimation in Spatial Databases - D654428 - GradeBuddy

  • List of Papers and Books

    "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

  • Spatial Databases

    Chapter 1 Spatial Databases 1.1 Introduction 1.1.1 Spatial Database Spatial database management systems [43, 58, 120, 119, 97, 74] aim at the effective and efficient management of data related to • a space such as the physical world (geography, urban planning

  • Range and region query processing in spatial databases

    With the boom of spatial databases, more and more spatial queries, which play a significant role in many academic and industrial areas, are proposed and studied extensively in last decade. One of the most fundamental queries among these is range search which returns all objects of interest within the pre-defined area. Because of the importance of the spatial queries, a mass of researches ...

  • Approximate range query processing in spatial network …

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

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

  • Approximate range query processing in spatial network …

     · Approximate range query processing in spatial network databases Approximate range query processing in spatial network databases AL-Khalidi, Haidar; Abbas, Zainab; Safar, Maytham 2013-03-01 00:00:00 Multimedia Systems (2013) 19:151–161 DOI 10.1007/s00530-012-0286-9 REGU LA R P APER • • Haidar AL-Khalidi Zainab Abbas Maytham Safar Published online: 20 July 2012 …

  • Approximately processing aggregate range queries on …

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

  • (PDF) Supporting spatial aggregation in sensor network …

    Supporting Spatial Aggregation in Sensor Network ∗ Databases Mehdi Sharifzadeh and Cyrus Shahabi Computer Science Department University of Southern California Los Angeles, CA 90089-0781 [sharifza, shahabi]@usc ABSTRACT General Terms Sensor networks are unattended deeply distributed systems Algorithms, Design, Performance whose schema can be conceptualized using the …

  • range aggregate processing spatial databases

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

  • Indexing range sum queries in spatio-temporal …

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

  • Range Aggregate Processing in Spatial Databases | IEEE …

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

  • Spatial database

    Spatial indices are used by spatial databases (databases which store information related to objects in space) to optimize spatial queries. Conventional index types do not efficiently handle spatial queries such as how far two points differ, or whether points fall within a spatial area of interest.

  • Efficient Maximum Range Search on Remote Spatial …

     · 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.) to effectively addressing these problems.

  • Range Aggregate Processing in Spatial Databases | IEEE …

    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

  • range aggregate processing spatial databases

    Range Aggregate Processing Spatial Databases. As a leading global manufacturer of crushing equipment, milling equipment,dressing equipment,drying equipment and briquette equipment etc. we offer advanced, rational solutions for any size-reduction requirements, including quarry, aggregate, grinding production and complete plant plan.

  • [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-dimensional data.

  • Algorithms for Fundamental Spatial Aggregate Operations Over …

    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

  • 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 ∗

  • Article: Approximately processing aggregate range …

     · International Journal of Knowledge and Web Intelligence 2013 Vol.4 No.4 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 '' Toho University, 3-11 Heiwagaoka, Meito-ku, Nagoya, 465-8515, Japan

  • Range aggregate processing in spatial databases

     · Range aggregate processing in spatial databases 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).

  • A Scalable Algorithm for Maximizing Range Sum in Spatial …

    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

  • Approximate range query processing in spatial network …

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

  • 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 efficiently processing these queries is required. This paper applies Regular Polygon based Search Algorithm (RPSA aggregate range

  • [PDF] Predicted Range Aggregate Processing in Spatio …

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

  • CiteSeerX — Search Results — Approximate range query …

    CiteSeerX - Scientific articles matching the query: Approximate range query processing in spatial network databases., which allow users to perform aggregation queries such as MIN, COUNT and AVG on a sensor network.Due to power and range constraints, centralized approaches are generally impractical, so most systems use in-network aggregation to reduce network traffic.

  • range aggregate processing 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

  • Approximately processing aggregate range queries on …

    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 interface... International Journal of Knowledge and Web Intelligence

  • 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] .cn

  • Euler Histogram Tree: A Spatial Data Structure for Aggregate Range Queries on Vehicle Trajectories

    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

Free Consult  or  Leave Message

Copyright © AMC | Sitemap

gotop