@conference {16879,
	title = {Efficient query processing on spatial networks},
	booktitle = {Proceedings of the 13th annual ACM international workshop on Geographic information systems},
	series = {GIS {\textquoteright}05},
	year = {2005},
	month = {2005///},
	pages = {200 - 209},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses path coherence between the shortest path and the spatial positions of vertices on the spatial network, thereby, resulting in an encoding that is compact in representation and fast in path and distance retrievals. Using this framework, a wide variety of spatial queries such as incremental nearest neighbor searches and spatial distance joins can be shown to work on datasets of locations residing on a spatial network of sufficiently large size. The suggested framework is suitable for both main memory and disk-resident datasets.},
	keywords = {location-based services, path coherence, Query processing, SILC framework, Spatial databases, spatial networks},
	isbn = {1-59593-146-5},
	doi = {10.1145/1097064.1097093},
	url = {http://doi.acm.org/10.1145/1097064.1097093},
	author = {Sankaranarayanan,Jagan and Alborzi,Houman and Samet, Hanan}
}
