@conference {16886,
	title = {Indexing distributed complex data for complex queries},
	booktitle = {Proceedings of the 2004 annual national conference on Digital government research},
	series = {dg.o {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {63:1{\textendash}63:10 - 63:1{\textendash}63:10},
	publisher = {Digital Government Society of North America},
	organization = {Digital Government Society of North America},
	abstract = {Peer-to-peer networks are becoming a common form of online data exchange. Querying data, mostly files, using keywords on peer-to-peer networks is well-known. But users cannot perform many types of queries on complex data and on many of the attributes of the data on such networks other than mostly exact-match queries. We introduce a distributed hashing-based index for enabling more powerful accesses on complex data over peer-to-peer networks that we expect to be commonly deployed for digital government applications. Preliminary experiments show that our index scales well and we believe that it can be extended to obtain similar indices for many other data types for performing various complex queries, such as range queries.},
	url = {http://dl.acm.org/citation.cfm?id=1124191.1124254},
	author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan}
}
