Hub Labels on the database for large-scale graphs with the COLD framework

  title={Hub Labels on the database for large-scale graphs with the COLD framework},
  author={Alexandros Efentakis and Christodoulos Efstathiades and Dieter Pfoser},
Shortest-path computation on graphs is one of the most well-studied problems in algorithmic theory. An aspect that has only recently attracted attention is the use of databases in combination with graph algorithms, so-called distance oracles, to compute shortest-path queries on large graphs. To this purpose, we propose a novel, efficient, pure-SQL framework for answering exact distance queries on large-scale graphs, implemented entirely on an open-source database engine. Our COLD framework… 



ReHub. Extending Hub Labels for Reverse k-Nearest Neighbor Queries on Large-Scale networks

ReHub is a novel main-memory algorithm that extends the hub labeling technique to efficiently answer reverse k-nearest neighbor queries on large-scale networks, requiring only minimal additional preprocessing and providing very fast query times in all cases.

Fast exact shortest-path distance queries on large networks by pruned landmark labeling

This work proposes a new exact method for shortest-path distance queries on large-scale networks that can handle social networks and web graphs with hundreds of millions of edges, which are two orders of magnitude larger than the limits of previous exact methods.

An Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index

This paper proposes an efficient algorithm for RFN query with metric index, and adapts the convex hull property to enhance the efficiency, but its computation is not on the fly.

Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks

This work proposes to build an index for answering point-to-point distance querying for massive scale-free graphs based on a novel hop-doubling labeling technique, and derives bounds on the index size, the computation costs and I/O costs based on the properties of unweighted scale- free graphs.

Scalable Public Transportation Queries on the Database

This work proposes PTLDB (Public Transporation Labels on the DataBase), a novel, scalable, pure-SQL framework for answering EA, LD and SD queries, implemented entirely on an open-source database system.

A Unified Framework for Efficiently Processing Ranking Related Queries

This paper presents the first algorithm which utilizes the presence of the index and achieves access optimality, i.e., it accesses a node of theindex only if the correctness of the results cannot be guaranteed without accessing this node.

HLDB: location-based services in databases

This paper introduces HLDB, the first practical system that can answer exact spatial queries on continental road networks entirely within a database. HLDB is based on hub labels (HL), the fastest

Efficiently computing reverse k furthest neighbors

This work is the first to propose a solution for arbitrary value of k that outperforms the state-of-the-art algorithm even for k = 1 and presents an efficient algorithm to process the RkFN queries.

Efficient algorithms for reverse proximity query problems

A general approach is presented that solves reverse proximity query problems in an efficient and unified way, in any dimension, using well-known geometric transformations and simple approximation algorithms in two and three dimensions that report points that are "close to" being the desired true reverse proximity neighbors, as determined by a user-specified error parameter.

G-tree: an efficient index for KNN search on road networks

Inspired by classical kNN search on metric space, a best-first search algorithm on road networks is introduced, and an elaborately-designed assembly-based method to efficiently compute the minimum distance from a G-tree node to the query location is proposed.