Reference Hub

This research has been cited in:

Conference
Efficient 2-Hop Labeling Maintenance in Dynamic Small-World Networks2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00019
Chapter
Knowledge-Guided Maximal Clique EnumerationAdvanced Data Mining and Applications10.1007/978-3-319-49586-6_43
Article
Parallel Hub Labeling Maintenance With High Efficiency in Dynamic Small-World NetworksIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3236632
Article
LG-Tree: An Efficient Labeled Index for Shortest Distance Search on Massive Road NetworksIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2022.3203432
Article
Planting trees for scalable and efficient canonical hub labelingProceedings of the VLDB Endowment10.14778/3372716.3372722
Conference
P2H: Efficient Distance Querying on Road Networks by Projected Vertex SeparatorsProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3459245
Article
Multi-constraint shortest path using forest hop labelingThe VLDB Journal10.1007/s00778-022-00760-2
Conference
Dynamic Hub Labeling for Road Networks2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00036
Conference
Double Hierarchical Labeling Shortest Distance Querying in Time-dependent Road Networks2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00161
Conference
Graph Calculus: Scalable Shortest Path Analytics for Large Social Graphs through Core Net2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT)10.1109/WI-IAT.2013.59
Conference
Skyline Nearest Neighbor Search on Multi-layer Graphs2019 IEEE 35th International Conference on Data Engineering Workshops (ICDEW)10.1109/ICDEW.2019.000-3
Conference
Efficient Constrained Shortest Path Query Answering with Forest Hop Labeling2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00155
Conference
Progressive Top-K Nearest Neighbors Search in Large Road NetworksProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3389746

TEDI: Efficient Shortest Path Query Answering on Graphs

Fang Wei

Source Title: Graph Data Management: Techniques and Applications

ISBN13: 9781613500538|ISBN10: 161350053X|EISBN13: 9781613500545

DOI: 10.4018/978-1-61350-053-8.ch009

Cite Chapter Cite Chapter

MLA

Wei, Fang. "TEDI: Efficient Shortest Path Query Answering on Graphs." Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, IGI Global, 2012, pp. 214-238. https://doi.org/10.4018/978-1-61350-053-8.ch009

APA

Wei, F. (2012). TEDI: Efficient Shortest Path Query Answering on Graphs. In S. Sakr & E. Pardede (Eds.), Graph Data Management: Techniques and Applications (pp. 214-238). IGI Global. https://doi.org/10.4018/978-1-61350-053-8.ch009

Chicago

Wei, Fang. "TEDI: Efficient Shortest Path Query Answering on Graphs." In Graph Data Management: Techniques and Applications, edited by Sherif Sakr and Eric Pardede, 214-238. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-61350-053-8.ch009

Export Reference

Favorite

View Full Text HTML

View Full Text PDF

Abstract

Our experimental results show that TEDI offers orders-of-magnitude performance improvement over existing approaches on the index construction time, the index size and the query answering.

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.

Username or email: *

Password: *

Forgot individual login password?

Create individual account

TEDI: Efficient Shortest Path Query Answering on Graphs

MLA

APA

Chicago

Export Reference

Abstract

Request Access