(Downloads - 0)
For more info about our services contact : help@bestpfe.com
Table of contents
1 Introduction
1.1 Motivation
1.2 Contributions
1.3 Outline
1.4 Publications
2 State of the Art: Location-temporal Range Queries on P2P Networks
2.1 Peer-to-Peer (P2P) Networks
2.1.1 Unstructured P2P overlay networks
2.1.1.1 Limitations of unstructured overlays
2.1.2 Structured P2P overlay networks
2.1.2.1 Chord
2.1.2.2 Pastry
2.1.2.3 CAN
2.1.2.4 Comparison of DHTs architectures
2.2 Location-temporal range queries over DHTs
2.2.1 Limitations of Distributed Hash Tables
2.3 Over-DHT solutions
2.3.1 Distributed Prex Trees
2.3.1.1 Prex Hash Tree
2.3.1.2 Place Lab
2.3.1.3 LIGHT
2.3.1.4 DRING
2.3.1.5 ECHO
2.3.1.6 Limitations of Distributed Prex Trees
2.3.2 Binary Trees
2.3.2.1 Distributed Segment Tree
2.3.2.2 Range Search Tree
2.4 DHT-dependent solutions
2.4.1 MAAN
2.4.2 Mercury
2.4.3 Squid
2.4.4 Saturn
2.5 Non-DHT solutions
2.5.1 Skip-List based solutions
2.5.2 Tree-based solutions
2.5.3 Voroni-Based Solutions
2.6 Discussion
2.6.1 Over-DHT solutions
2.6.2 DHT-dependent solutions
2.6.3 Non-DHT solutions
2.7 Summary
3 Big-LHT: An index for n-recent geolocalized queries
3.1 Introduction
3.2 Design
3.2.1 Query denition
3.2.2 Indexing structure
3.2.3 Mapping
3.2.4 LHT maintenance
3.2.5 Managers maintenance
3.2.6 Query processing
3.3 Evaluation
3.3.1 Theoretical evaluation
3.3.2 Experimental evaluation
3.4 Discussion
3.4.1 Advantages
3.4.2 Limitations
3.5 Conclusion
4 GeoTrie: An index for location-temporal range queries
4.1 Introduction
4.2 Design
4.2.1 Query denition
4.2.2 Indexing structure
4.2.3 Mapping
4.2.4 Index maintenance
4.2.5 Query Processing
4.2.6 Caching optimisation
4.3 Evaluation
4.3.1 Theoretical evaluation
4.3.2 Experimental evaluation
4.4 Discussion
4.4.1 Advantages
4.4.2 Limitations
4.5 Conclusion
5 Conclusion and Future Work
5.1 Conclusion
5.2 Future Work
Bibliography
