Partitioning Queries on Large Spatial Databases

First Page		Document Content
Date: 2014-03-08 19:35:53 R-tree B-tree Binary tree Tree traversal K-d tree Bin Tree Hash tree Trie Graph theory Computing Data management		Partitioning Queries on Large Spatial Databases Add to Reading List Source URL: people.csail.mit.edu Download Document from Source Website File Size: 985,66 KB Share Document on Facebook

	Cooperative XPath Caching Kostas Lillis and Evaggelia Pitoura Computer Science Department University of Ioannina, Greece {klillis, DocID: 1rqvV - View Document
	The Architecture of PIER: an Internet-Scale Query Processor Ryan Huebsch, Brent Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, Scott Shenker, Ion Stoica and Aydan R. Yumerefendi UC Berkeley DocID: 1r0TY - View Document
	Microsoft Word - article4.doc DocID: 1qZW6 - View Document
	BATON: A Balanced Tree Structure for Peer-to-Peer Networks H.V. Jagadish 1,2 DocID: 1qq4a - View Document
	1242 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 17, DocID: 1qadb - View Document