2,735 Hits in 3.2 sec

Study of Spatial Data Index Structure Based on Hybrid Tree [chapter]

Yonghui Wang, Yunlong Zhu, Huanliang Sun
2011 Advances in Intelligent and Soft Computing  
The insertion, deletion and query algorithm are implemented based on the hybrid tree, and the accuracy and efficiency are verified.  ...  than the R-tree in the retrieval efficiency, and with the data volume increasing the advantage is more obvious.  ...  2 Quad-Tree and R*-Tree Quad-Tree A quad-tree [1] is a kind of important hierarchical data structure, mainly used to express spatial hierarchy in two-dimensional coordinates.  ... 
doi:10.1007/978-3-642-25661-5_68 fatcat:h5soqpsf4vhflj4zlfw4lf7ca4

Quad trees a data structure for retrieval on composite keys

R. A. Finkel, J. L. Bentley
1974 Acta Informatica  
Remaining problems include those of deletion from quad trees and merging of quad trees, which seem to be inherently difficult operations.  ...  We discuss the specific case of two-dimensional retrieval, although the structure is easily generalis~ to arbitrary dimensions.  ...  Unfortunately, deletion from quad trees and merging of two quad trees is not easy. The basic concepts involved can easilybe generalized to an arbitrary number of dimensions.  ... 
doi:10.1007/bf00288933 fatcat:3shovoqmk5fkbox7e5rzmlwjem

Page 4274 of Mathematical Reviews Vol. , Issue 83j [page]

1983 Mathematical Reviews  
We define a structure similar to a quad-tree, called a pseudo-quad-tree, and show how it can be used to handle both insertions and deletions in O(log? N) average time.  ...  Authors’ summary: “Quad-trees and k-d trees have been noted for their lack of dynamic properties as data structures for multi- dimensional point sets.  ... 

Enhancing Quad Tree for Spatial Index Using Space Filling Curves

Ali A. Hussain, Rehab F. Hassan
2020 Engineering and Technology Journal  
In this paper, the quad tree was improved by combining it with one of the space filling curve types, resulting in reduced storage space requirements and improved implementation time  ...  Spatial indexes, such as those based on the Quad Tree, are important in spatial databases for the effective implementation of queries with spatial constraints, especially when queries involve spatial links  ...  By those lines, the rectangles or particles in this two-dimensional space may be traced in a linear manner. Which offers the possibility of mapping two-dimensional objects to one-dimensional objects.  ... 
doi:10.30684/etj.v38i1b.264 fatcat:znc47winebffvesejdgrfprq7e

A State-of-Art in R-Tree Variants for Spatial Indexing

Lakshmi Balasubramanian, M. Sugumaran
2012 International Journal of Computer Applications  
R-Tree is the most widely used index structure for multi-dimensional data.  ...  In this work, state-of-art of variants in R-Tree is presented.  ...  Updates in this variant can be any combinations like within the same MBR in R-Tree, between MBRs in R-Tree, from R-Tree to Quad Tree, within same quadrant in Quad Tree, between different quadrants in R-Tree  ... 
doi:10.5120/5819-8132 fatcat:xgb5y5hdvnf7lk3hmdu44u2jji

Enhancing Performance of GIS on Cloud Computing

Ahmed Teaima, Hesham Ahmed, BahaaShabana B.S
2015 International Journal of Advanced Computer Science and Applications  
This paper will study some example of a data structure like a K-d tree and Quad trees of GIS application and compare between them when storing these data structures on Cloud computing, the paper also portrays  ...  Cloud Computing used to portray and help users to use GIS applications in an easy way.  ...  The result illustrates that the data type of GIS should store in a -quad tree in multidimensional array‖ which give better performance than the two other types, K-d tree and Quad tree in the hash function  ... 
doi:10.14569/ijacsa.2015.061106 fatcat:lqdmgboirjfcjcaf7rm22w767m

Study on Application of Location Algorithm Base Multidimensional Spatial Information in the Situation Analysis of Natural Ecology [chapter]

Jumei Ai, Shuhua Mao
2011 IFIP Advances in Information and Communication Technology  
In this paper, the algorithm was designed of quad-tree spatial search based on spatial information multi-dimensional features, the traditional quad-tree algorithm has been improved to a specific spatial  ...  attribute value binding in the quad-tree leaf nodes, a large number with a specific operation irrelevant attributes are excluded, to the effect of finding targets.  ...  The Design of Quad-Tree Location Algorithm Quadtree is a suitable algorithm in two-dimensional picture localization pixel.  ... 
doi:10.1007/978-3-642-18354-6_84 fatcat:bcs6ls6nu5gila6pknhiv6sddm

A Vor-KVGQ Index Structure of Mobile Objects Based on CoveRed Area

Ziwei Zeng, Chi Ma, Yubin Huang, Wei Jing
2015 International Journal of Hybrid Information Technology  
index structures, the Vor-KVGQ index structure of mobile objects with keyword that combine grid Quad tree( Keyword Virtual Grid Quad tree, KVGQ) with Voronoi diagram based on covered area is one of them  ...  In recent years, the rapid development of high technologies, led the emergence of a variety of new applications.  ...  this paper is two-dimensional.  ... 
doi:10.14257/ijhit.2015.8.5.20 fatcat:mdmdgagqjvcyxgrts5fnmyrjfa

Indexing spatial data in cloud data managements

Ling-Yin Wei, Ya-Ting Hsu, Wen-Chih Peng, Wang-Chien Lee
2014 Pervasive and Mobile Computing  
In this paper, we present a novel key design based on an R + -tree (KR + -index) for retrieving skewed spatial data efficiently.  ...  In the experiments, we implement the KR + -index on Cassandra, and study its performance using spatial data. Experiments show that the KR + -index outperforms thestate-of-the-art methods.  ...  In quad-trees, each internal node has exactly four children.  ... 
doi:10.1016/j.pmcj.2013.07.001 fatcat:drahgbok4fei7p2d47vamhf4oq

XML Databases: Modeling and Multidimensional Indexing [chapter]

Rudolf Bayer
2001 Lecture Notes in Computer Science  
Bayer, TUM 5 Operations with Trees • store in rel.  ...  DBMS • find documents based on path search predicates • retrieve parts of found documents • insert and delete documents in a DB • modify documents, i.e. delete and insert subtrees of a document  ... 
doi:10.1007/3-540-44759-8_1 fatcat:hv5jlhqqave4fpeigzin63ciki

GLIN: A Lightweight Learned Indexing Mechanism for Complex Geometries [article]

Congying Wang, Jia Yu
2022 arXiv   pre-print
Our experiments on real-world and synthetic datasets show that GLIN occupies 40-70 times less storage overhead than popular spatial indexes such as Quad-Tree while still showing similar query response  ...  time in medium selectivity queries.  ...  Moreover, GLIN's maintenance speed is around 1.5 times higher on insertion and 3 -5 times higher on deletion as opposed to R-Tree and Quad-Tree.  ... 
arXiv:2207.07745v1 fatcat:sruzv2hasbguvlwm3m5c3c7vti

Page 17 of Hewlett-Packard Journal Vol. 38, Issue 5 [page]

1987 Hewlett-Packard Journal  
To degenerate the quad tree to a linear list, all points must be placed along a single line (a shape that is uncommon in mechanical drawings). The shape of the quad tree depends on input order.  ...  If the model shape is equal to a nearly horizontally or vertically extended object, the quad tree degenerates to a binary tree.  ... 

A Core Model Supporting Location-Aware Computing in Smart Classroom [chapter]

Hongliang Gu, Yuanchun Shi, Guangyou Xu, Yu Chen
2005 Lecture Notes in Computer Science  
Acknowledgements This research is supported by NCET(Program for New Century Excellent Talents in University, China), NSFC(Natural Science Foundation, China) and the funding from Lenovo Research Institute  ...  This operation is as follows: 1) if the entity points at a quad-tree, cut off the link between the entity and its quad-tree. 2) Delete the entity's node from R-tree.  ...  R-tree is suitable for organizing of multi-dimensional data, such as space data.  ... 
doi:10.1007/11528043_1 fatcat:xf5fp6luxbdw7g5bron76nttzq

MD-HBase: A Scalable Multi-dimensional Data Infrastructure for Location Aware Services

Shoji Nishimura, Sudipto Das, Divyakant Agrawal, Amr El Abbadi
2011 2011 IEEE 12th International Conference on Mobile Data Management  
We present the design of MD-HBase that builds two standard index structures-the K-d tree and the Quad tree-over a range partitioned Key-value store.  ...  The ubiquity of location enabled devices has resulted in a wide proliferation of location based applications and services.  ...  Multi-dimensional Index Structures The Quad tree [3] and the K-d tree [2] are two of the most popular multi-dimensional indexing structures.  ... 
doi:10.1109/mdm.2011.41 dblp:conf/mdm/NishimuraDAA11 fatcat:4rrigdhhrzg27mdsbti6mzziuq

Comparison of Advance Tree Data Structures

Parth Patel, Deepak Garg
2012 International Journal of Computer Applications  
Btree and Rtree are two basic index structures; many different variants of them are proposed after them. Different variants are used in specific application for the performance optimization.  ...  In this paper different variants of Btree and Rtree are discussed and compared. Index structures are different in terms of structure, query support, data type support and application.  ...  It use quad tree and z-ordering, quad tree divides object into quad tree blocks and increase no of item.  ... 
doi:10.5120/5512-7504 fatcat:qxyhgyx4yrgelpnl44gvvz4w3i
« Previous Showing results 1 — 15 out of 2,735 results