Hierarchical graph indexing

Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs with hundreds of millions of vertices and edges. We propose efficient techniques for managing such graphs at the storage level in order to facilitate its processing at the interface level(visualization). The methods are based on a hierarchical decomposition of the graph edge set that is inherited from a hierarchical decomposition of the vertex set. Real time navigation is provided by an efficient two level indexing schema called the gkd∗ -tree. The first level is a variation of a kd-tree index that partitions the edge set in a way that conforms to the hierarchical decomposition and the data distribution (the gkd-tree). The second level is a redundant R∗ -tree that indexes the leaf pages of the gkdtree. We provide computational results that illustrate the superiority of the gkd∗ -tree against conventiona...

• Type: Conference
• Year: 2003
• Where: CIKM
• Authors: James Abello, Yannis Kotidis
• Keywords: CIKM 2003, Gkd∗ -tree, Hierarchical Decomposition, Level Indexing Schema