Efficient secondary memory processing of window queries on spatial data-Reference-Cited by-同舟云学术

Efficient secondary memory processing of window queries on spatial data

Published:1995-05 Issue:1-2 Volume:84 Page:67-83
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Nardelli Enrico,Proietti Guido

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference17 articles.

1. A B+-tree structure for large quadtrees;Abel;Computer Vision, Graphics and Image Processing,1984

2. Efficient processing of window queries in the pyramid data structure;Aref,1990

3. The R∗-tree: An efficient and robust access method for points and rectangles;Beckmann,1990

4. The space efficiency of quadtrees;Dyer;Computer Graphics and Image Processing,1982

5. What's special about spatial: Database requirements for vehicle navigation in geographic space;Egenhofer,1993

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MI-HCS: Monotonically Increasing Hilbert Code Segments for 3D Geospatial Query Window;IEEE Access;2020

2. An Optimal Algorithm for Searching the Optimal Translation of Query Windows in Quadtree Decomposition;IEICE Transactions on Information and Systems;2011

3. Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query;Information Sciences;2007-05

4. Mining spatial association rules in image databases;Information Sciences;2007-04

5. A strip-splitting-based optimal algorithm for decomposing a query window into maximal quadtree blocks;IEEE Transactions on Knowledge and Data Engineering;2004-04