High Dimensional Spatial Indexing Using Space-Filling Curves
High Dimensional Spatial Indexing Using Space-Filling Curves

Author: Ankush Chauhan

Publisher: Grin Publishing

Published: 2016-07-21

Total Pages: 16

ISBN-13: 9783668260122

DOWNLOAD EBOOK

Scientific Essay from the year 2015 in the subject Mathematics - Miscellaneous, language: English, abstract: Representation of two dimensional objects into one dimensional space is simple and efficient when using a two coordinate system imposed upon a grid. However, when the two dimensions are expanded far beyond visual and sometimes mental understanding, techniques are used to quantify and simplify the representation of such objects. These techniques center around spatial interpretations by means of a space-filling curve. Since the late 1800's, mathematicians and computer scientists have succeeded with algorithms that express high dimensional geometries. However, very few implementations of the algorithms beyond three dimensions for computing these geometries exist. We propose using the basic spatial computations developed by pioneers in the field like G. Peano, D. Hilbert, E. H. Moore, and others in a working model. The algorithms in this paper are fully implemented in high-level programming languages utilizing a relation database management system. We show the execution speeds of the algorithms using a space-filling curve index for searching compared to brute force searching. Finally, we contrast three space-filling curve algorithms: Moore, Hilbert, and Morton, in execution time of searching for high dimensional data in point queries and range queries.

High-Dimensional Indexing
High-Dimensional Indexing

Author: Cui Yu

Publisher: Springer

Published: 2003-08-01

Total Pages: 159

ISBN-13: 3540457704

DOWNLOAD EBOOK

In this monograph, we study the problem of high-dimensional indexing and systematically introduce two efficient index structures: one for range queries and the other for similarity queries. Extensive experiments and comparison studies are conducted to demonstrate the superiority of the proposed indexing methods. Many new database applications, such as multimedia databases or stock price information systems, transform important features or properties of data objects into high-dimensional points. Searching for objects based on these features is thus a search of points in this feature space. To support efficient retrieval in such high-dimensional databases, indexes are required to prune the search space. Indexes for low-dimensional databases are well studied, whereas most of these application specific indexes are not scaleable with the number of dimensions, and they are not designed to support similarity searches and high-dimensional joins.

R-tree Index Optimization
R-tree Index Optimization

Author: D. M. Gavrila

Publisher:

Published: 1994

Total Pages: 20

ISBN-13:

DOWNLOAD EBOOK

Abstract: "The optimization of spatial indexing is an increasingly important issue considering the fact that spatial databases, in such diverse areas as geographical, CAD/CAM and image applications, are growing rapidly in size and often contain on the order of millions of items or more. This necessitates the storage of the index on disk, which has the potential of slowing down the access time significantly. In this paper, we discuss ways of minimizing the disk access frequency by grouping together data items which are close to one another in the spatial domain ('packing'). The data structure which we seek to optimize here is the R- tree for a given set of data objects. Existing methods of building an R- tree index based on space-filling curves (Peano, Hilbert) are computationally cheap, but they do not preserve spatial locality well, in particular when dealing with higher-dimensional data of non-zero extent. On the other hand, existing methods of packing based on all dimensions of the data, such as the several proposed dynamic R-tree insertion algorithms, do not take advantage of the fact that all the data objects are known beforehand. Furthermore, they are essentially serial in nature. In this paper, we regard packing as an optimization problem and propose an iterative method of finding a close-to-optimal solution to the packing of a given set of spatial objects in D dimensions. The method achieves a high degree of parallelism by constructing the R-tree bottom-up. In experiments on data of various dimensionalities and distributions, we have found that the proposed method can significantly improve on the packing performance of the R* insertion algorithm and the Hilbert curve. It is shown that the improvements increase with the skewness of the data and, in some cases, can even amount to an order of magnitude in terms of decreased response time."

Encyclopedia of GIS
Encyclopedia of GIS

Author: Shashi Shekhar

Publisher: Springer Science & Business Media

Published: 2007-12-12

Total Pages: 1392

ISBN-13: 038730858X

DOWNLOAD EBOOK

The Encyclopedia of GIS provides a comprehensive and authoritative guide, contributed by experts and peer-reviewed for accuracy, and alphabetically arranged for convenient access. The entries explain key software and processes used by geographers and computational scientists. Major overviews are provided for nearly 200 topics: Geoinformatics, Spatial Cognition, and Location-Based Services and more. Shorter entries define specific terms and concepts. The reference will be published as a print volume with abundant black and white art, and simultaneously as an XML online reference with hyperlinked citations, cross-references, four-color art, links to web-based maps, and other interactive features.

Accumulo
Accumulo

Author: Aaron Cordova

Publisher: "O'Reilly Media, Inc."

Published: 2015-07

Total Pages: 552

ISBN-13: 1491946938

DOWNLOAD EBOOK

Get up to speed on Apache Accumulo, the flexible, high-performance key/value store created by the National Security Agency (NSA) and based on Google’s BigTable data storage system. Written by former NSA team members, this comprehensive tutorial and reference covers Accumulo architecture, application development, table design, and cell-level security. With clear information on system administration, performance tuning, and best practices, this book is ideal for developers seeking to write Accumulo applications, administrators charged with installing and maintaining Accumulo, and other professionals interested in what Accumulo has to offer. You will find everything you need to use this system fully. Get a high-level introduction to Accumulo’s architecture and data model Take a rapid tour through single- and multiple-node installations, data ingest, and query Learn how to write Accumulo applications for several use cases, based on examples Dive into Accumulo internals, including information not available in the documentation Get detailed information for installing, administering, tuning, and measuring performance Learn best practices based on successful implementations in the field Find answers to common questions that every new Accumulo user asks

Spatial Data Management
Spatial Data Management

Author: Nikos Mamoulis

Publisher: Morgan & Claypool Publishers

Published: 2012

Total Pages: 152

ISBN-13: 1608458326

DOWNLOAD EBOOK

Spatial database management deals with the storage, indexing, and querying of data with spatial features, such as location and geometric extent. Many applications require the efficient management of spatial data, including Geographic Information Systems, Computer Aided Design, and Location Based Services. The goal of this book is to provide the reader with an overview of spatial data management technology, with an emphasis on indexing and search techniques. It first introduces spatial data models and queries and discusses the main issues of extending a database system to support spatial data. It presents indexing approaches for spatial data, with a focus on the R-tree. Query evaluation and optimization techniques for the most popular spatial query types (selections, nearest neighbor search, and spatial joins) are portrayed for data in Euclidean spaces and spatial networks. The book concludes by demonstrating the ample application of spatial data management technology on a wide range of related application domains: management of spatio-temporal data and high-dimensional feature vectors, multi-criteria ranking, data mining and OLAP, privacy-preserving data publishing, and spatial keyword search. Table of Contents: Introduction / Spatial Data / Indexing / Spatial Query Evaluation / Spatial Networks / Applications of Spatial Data Management Technology

Advances in Spatial and Temporal Databases
Advances in Spatial and Temporal Databases

Author: Nikos Mamoulis

Publisher: Springer Science & Business Media

Published: 2009-06-30

Total Pages: 478

ISBN-13: 3642029817

DOWNLOAD EBOOK

This volume constitutes the refereed proceedings of the 11th International Symposium on Spatial and Temporal Databases, SSTD 2009, held in Aalborg, Denmark, in July 2009. The 20 revised full papers presented together with 3 keynotes, 7 short papers, and 10 demonstration papers, were thoroughly reviewed and selected from a total of 62 research submissions and 11 demonstration submissions. The papers are organized in topical sections on spatial and flow networks, integrity and security, uncertain data and new technologies, indexing and monitoring moving objects, advanced queries, as well as on models and languages.

Current Trends and Challenges in RFID
Current Trends and Challenges in RFID

Author: Cornel Turcu

Publisher: BoD – Books on Demand

Published: 2011-07-20

Total Pages: 518

ISBN-13: 953307356X

DOWNLOAD EBOOK

With the increased adoption of RFID (Radio Frequency Identification) across multiple industries, new research opportunities have arisen among many academic and engineering communities who are currently interested in maximizing the practice potential of this technology and in minimizing all its potential risks. Aiming at providing an outstanding survey of recent advances in RFID technology, this book brings together interesting research results and innovative ideas from scholars and researchers worldwide. Current Trends and Challenges in RFID offers important insights into: RF/RFID Background, RFID Tag/Antennas, RFID Readers, RFID Protocols and Algorithms, RFID Applications and Solutions. Comprehensive enough, the present book is invaluable to engineers, scholars, graduate students, industrial and technology insiders, as well as engineering and technology aficionados.