@conference {16841,
	title = {A sorting approach to indexing spatial data},
	booktitle = {ACM SIGGRAPH 2008 classes},
	series = {SIGGRAPH {\textquoteright}08},
	year = {2008},
	month = {2008///},
	pages = {91:1{\textendash}91:15 - 91:1{\textendash}91:15},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Spatial data is distinguished from conventional data by having extent. Therefore, spatial queries involve both the objects and the space that they occupy. The handling of queries that involve spatial data is facilitated by building an index on the data. The traditional role of the index is to sort the data, which means that it orders the data. However, since generally no ordering exists in dimensions greater than 1 without a transformation of the data to one dimension, the role of the sort process is one of differentiating between the data and what is usually done is to sort the spatial objects with respect to the space that they occupy. The resulting ordering is usually implicit rather than explicit so that the data need not be resorted (i.e., the index need not be rebuilt) when the queries change (e.g., the query reference objects). The index is said to order the space and the characteristics of such indexes are explored further.},
	doi = {10.1145/1401132.1401250},
	url = {http://doi.acm.org/10.1145/1401132.1401250},
	author = {Samet, Hanan}
}
