2006
DOI: 10.1007/s00778-005-0001-y
|View full text |Cite
|
Sign up to set email alerts
|

Using a distributed quadtree index in peer-to-peer networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
72
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 130 publications
(72 citation statements)
references
References 27 publications
0
72
0
Order By: Relevance
“…Quad trees have been previously used for a large number of goals, including for addressing geographical-related problems concerning the monitoring and tracking of moving objects [20] and for querying data in peer-to-peer networks [19]. QTree is inspired by these works, building a query specific tree during query dissemination.…”
Section: Related Workmentioning
confidence: 99%
“…Quad trees have been previously used for a large number of goals, including for addressing geographical-related problems concerning the monitoring and tracking of moving objects [20] and for querying data in peer-to-peer networks [19]. QTree is inspired by these works, building a query specific tree during query dissemination.…”
Section: Related Workmentioning
confidence: 99%
“…The index builds a multidimensional Cartesian space based on the Grid resource attributes. The logical index assigns regions of space [30] to GFAs in the resource discovery system. If a GFA is assigned a region in the multidimensional space, then it is responsible for handling all the activities related to RLQs and RUQs associated with that region.…”
Section: Resource Discoverymentioning
confidence: 99%
“…However, complex queries like range and top-k are particularly challenging in DHT systems. There have been recent works addressing range [3,11,14] and top-k [1] queries for spatial databases, but as far as we know, spatial-temporal queries have not been proposed using DHT systems.…”
Section: Introductionmentioning
confidence: 99%