Efficient Processing of Range Queries over Distributed Relational Databases

2018 ◽  
Author(s):  
Richard Price ◽  
Lakshmish Ramaswamy ◽  
Seyedamin Pouriyeh
Keyword(s):  
Relational Databases ◽  
Range Queries ◽  
Efficient Processing

scholarly journals Querying Uncertain Data in Geospatial Object-relational Databases Using SQL and Fuzzy Sets

2013 ◽  
Vol 21 (4) ◽  
pp. 1-12 ◽  
Author(s):  
R. Ďuračiová
Keyword(s):  
Fuzzy Sets ◽  
Spatial Data ◽  
Relational Databases ◽  
Spatial Databases ◽  
Query Language ◽  
Uncertain Data ◽  
Uncertainty Modeling ◽  
Geographic Information ◽  
Object Relational ◽  
Efficient Processing

Abstract This paper deals with uncertainty modeling in spatial object-relational databases by the use of Structured Query Language (SQL). The fundamental principles of uncertainty modeling by fuzzy sets are applied in the area of geographic information systems (GIS) and spatial databases. A spatial database system includes types of spatial data and implements the spatial extension of SQL. The implementation of the principles of fuzzy logic to spatial databases brings an opportunity for the efficient processing of uncertain data, which is important, especially when using various data sources (e.g., multi-criteria decision making (MCDM) on the basis of heterogeneous spatial data resources). The modeling and data processing of uncertainties are presented in relation to the applicable International Organization for Standardization (ISO) standards (standards of the series 19100 Geographic information) and the relevant specifications of the Open Geospatial Consortium (OGC). The fuzzy spatial query approach is applied and tested on a case study with a fundamental database for GIS in Slovakia.

scholarly journals Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

2014 ◽  
Vol 6 (1) ◽  
pp. 29-43
Author(s):  
KwanHo In ◽  
HaRim Jung ◽  
Hee Yong Youn ◽  
Ung-Mo Kim
Keyword(s):  
Range Queries ◽  
Wireless Broadcast ◽  
Spatial Range ◽  
Efficient Processing

Efficient Processing of Continual Range Queries for Location-Aware Mobile Services

2005 ◽  
Vol 7 (4-5) ◽  
pp. 435-448 ◽  
Author(s):  
Kun-Lung Wu ◽  
Shyh-Kwei Chen ◽  
Philip S. Yu
Keyword(s):  
Mobile Services ◽  
Range Queries ◽  
Location Aware ◽  
Efficient Processing

scholarly journals Trajectory Indexing for Efficient Processing of Range Queries

2009 ◽  
Vol 16D (4) ◽  
pp. 487-496
Author(s):  
Chang-Il Cha ◽  
Sang-Wook Kim ◽  
Jung-Im Won
Keyword(s):  
Range Queries ◽  
Efficient Processing ◽  
Trajectory Indexing

Estimating the Completeness of Range Queries over Structured P2P Databases

2012 ◽  
pp. 251-281
Author(s):  
Alfredo Cuzzocrea ◽  
Marcel Karnstedt ◽  
Manfred Hauswirth ◽  
Kai-Uwe Sattler ◽  
Roman Schmidt
Keyword(s):  
Large Scale ◽  
Web Applications ◽  
Rapid Development ◽  
Database Systems ◽  
Range Queries ◽  
Distributed Information ◽  
Wide Range ◽  
Efficient Processing ◽  
Processing Techniques

Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be utilized in order to provide efficient techniques for processing them, resulting in the support of applications and techniques based on range queries in large-scale distributed information systems. On the other hand, due to the rapid development of the Web, applications based on the P2P paradigm gain more and more interest, having such systems started to evolve towards adopting standard database functionalities in terms of complex query processing support. This goes far beyond simple key lookups, as provided by standard distributed hashtables (DHTs) systems, which makes estimating the completeness of query answers a crucial challenge. Unfortunately, due to the limited knowledge and the usually best-effort characteristics, deciding about the completeness of query results, e.g., getting an idea when a query is finished or what amount of results is still missing, is very challenging. There is not only an urgent need to provide this information to the user issuing queries, but also for implementing sophisticated and efficient processing techniques based on them. In this chapter, the authors propose a method for solving this task. They discuss the applicability and quality of the estimations, present an implementation and evaluation for the P-Grid system, and show how to adapt the technique to other overlays. The authors also discuss the semantics of completeness for complex queries in P2P database systems and propose methods based on the notion of routing graphs for estimating the number of expected query answers. Finally, they discuss probabilistic guarantees for the estimated values and evaluate the proposed methods through an implemented system.

Sign in / Sign up

Export Citation Format

Share Document