#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1991

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Randall T. Whitman, Michael B. Park, Sarah M. Ambrose, Erik G. Hoel
- SIGSPATIAL/GIS
- 2014

Effective processing of extremely large volumes of spatial data has led to many organizations employing distributed processing frameworks. Hadoop is one such open-source framework that is enjoying widespread adoption. In this paper, we detail an approach to indexing and performing key analytics on spatial data that is persisted in HDFS. Our technique… (More)

- Erik G. Hoel, Hanan Samet
- SSD
- 1991

A study is performed of the issues arising in the e cient processing of spatial queries in large spatial databases. The domain is restricted to line segment databases such as those found in transportation networks and polygonal maps. Three classes of queries are identi ed. Those that deal with the line segments themselves, those that involve both the line… (More)

- Erik G. Hoel, Hanan Samet
- VLDB
- 1994

The performance of data-parallel algorithms for spatial operations using data-parallel variants of the bucket PMR quadtree, R-tree, and R-tree spatial data structures is compared. The studied operations are data structure build, polygonization, and spatial join in an application domain consisting of planar line segment data (i.e., Bureau of the Census… (More)

- Erik G. Hoel, Hanan Samet
- SIGMOD Conference
- 1992

A qualitative comparative study is performed of the performance of three popular spatial indexing methods - the R-tree, R<supscrpt>+</supscrpt>-tree, and the PMR quadtree-in the context of processing spatial queries in large line segment databases. The data is drawn from the TIGER/Line files used by the Bureau of the Census to deal with the road networks in… (More)

- Marios Hadjieleftheriou, Erik G. Hoel, Vassilis J. Tsotras
- GeoInformatica
- 2005

With the proliferation of spatial and spatio-temporal data that are produced everyday by a wide range of applications, Geographic Information Systems (GIS) have to cope with millions of objects with diverse spatial characteristics. Clearly, under these circumstances, substantial performance speed up can be achieved with the use of spatial, spatio-temporal… (More)

- Erik G. Hoel, Hanan Samet
- VLDB
- 1995

The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R -tree, R-tree, and the PMR quadtree. The focus is on a spatial join with spatial output because the result of the spatial join frequently serves as input to subsequent spatial operations (i.e., a cascaded spatial join as would be common in a… (More)

- Erik G. Hoel, Hanan Samet
- ICPP
- 1994

E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data (i.e., Bureau of the Census TIGER/Line les). Parallel algorithms for map intersection and a spatial range query are described. The algorithms are implemented using the SAM… (More)

- John F. Roddick, Max J. Egenhofer, Erik G. Hoel, Dimitris Papadias, Betty Salzberg
- SIGMOD Record
- 2004

Spatial and temporal database systems, both in theory and in practice, have developed dramatically over the past two decades to the point where usable commercial systems, underpinned by a robust theoretical foundation, are now starting to appear. While much remains to be done, topics for research must be chosen carefully to avoid embarking on impractical or… (More)

- Erik G. Hoel, Wee-Liang Heng, Dale Honeycutt
- SSTD
- 2005

Networks often form the core of many users’ spatial databases. Networks are used to support the rapid navigation and analysis of linearly connected data such as that found in transportation networks. Common types of analysis performed on such networks include shortest path, traveling salesman, allocation, and distance matrix computation. Network data models… (More)

- Erik G. Hoel, Hanan Samet
- 1993 International Conference on Parallel…
- 1993

Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data (e.g., Bureau of the Census TIGER/Line files). Parallel algorithms for both building the data-parallel R-tree, as well as determining the closed polygons formed by the line segments, are described and implemented using the SAM… (More)