Thumbnail
Access Restriction
Subscribed

Author Olken, F. ♦ Rotem, D.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1993
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Sampling methods ♦ Spatial databases ♦ Data structures ♦ Geographic Information Systems ♦ Probability ♦ Urban planning ♦ Laboratories ♦ Cyclotrons ♦ Management information systems ♦ Demography
Abstract Techniques for obtaining random point samples from spatial databases are described. Random points are sought from a continuous domain that satisfy a spatial predicate which is represented in the database as a collection of polygons. Several applications of spatial sampling are described. Sampling problems are characterized in terms of two key parameters: coverage (selectivity), and expected stabbing number (overlap). Two fundamental approaches to sampling with spatial predicates, depending on whether one samples first or evaluates the predicate first, are discussed. The approaches are described in the context of both quadtrees and R-trees, detailing the sample-first, A/R-tree, and partial area tree algorithms. A sequential algorithm, the one-pass spatial reservoir algorithm, is also described.<<ETX>>
Description Author affiliation: Lawrence Berkeley Lab., CA, USA (Olken, F.)
ISBN 0818635703
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1993-04-19
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 731.07 kB
Page Count 10
Starting Page 199
Ending Page 208


Source: IEEE Xplore Digital Library