NDLI: Shortest-path queries for complex networks: exploiting low tree-width outside the core

Please wait, while we are loading the content...

Clydesdale: structured data processing on MapReduce

Differentially private search log sanitization with optimal output utility

RecStore: an extensible and adaptive framework for online recommender queries inside the database engine

On optimizing relational self-joins

User oriented trajectory search for trip recommendation

An adaptive algorithm for online time series segmentation with error bound guarantee

Transactional stream processing

Efficient approximation of the maximal preference scores by lightweight cubic views

Optimizing index deployment order for evolving OLAP

Subscription indexes for web syndication systems

Searching by corpus with fingerprints

CRSI: a compact randomized similarity index for set-valued features

Adaptive MapReduce using situation-aware mappers

Finding top-k similar graphs in graph databases

SIMP: accurate and efficient near neighbor search in high dimensional spaces

Introducing MapLan to map banking survey data into a time series database

Towards an ecosystem of structured data on the web

An optimization framework for map-reduce queries

Integrating historical noisy answers for improving data utility under differential privacy

Supporting top-K item exchange recommendations in large online communities

Transitive closure and recursive Datalog implemented on clusters

Top-k spatial keyword queries on road networks

Dynamic diversification of continuous data

Skyline-sensitive joins with LR-pruning

Distance histogram computation based on spatiotemporal uniformity in scientific data

Heuristics-based query optimisation for SPARQL

Aggregate queries on probabilistic record linkages

VAST-Tree: a vector-advanced and compressed structure for massive data tree traversal

"Cut me some slack": latency-aware live migration for databases

I/O cost minimization: reachability queries processing over massive graphs

Effectively indexing the multi-dimensional uncertain objects for range searching

Extending a general-purpose streaming system for XML

Inside "Big Data management": ogres, onions, or parfaits?

Efficient parallel kNN joins for large data in MapReduce

Mining probabilistically frequent sequential patterns in uncertain databases

Limiting link disclosure in social network analysis through subgraph-wise perturbation

Shortest-path queries for complex networks: exploiting low tree-width outside the core

Relevance search in heterogeneous networks

Towards "intelligent compression" in streams: a biased reservoir sampling based Bloom filter approach

Top-k interesting phrase mining in ad-hoc collections using sequence pattern indexing

A generic data model and query language for spatiotemporal OLAP cube analysis

See what's enBlogue: real-time emergent topic identification in social media

Efficient distributed query processing for autonomous RDF databases

Repair-oriented relational schemas for multidimensional databases

Peak power plays in database engines

Finding maximal k-edge-connected subgraphs from a large graph

SFA: a symbolic fourier approximation and index for similarity search in high dimensional datasets

Mining search behavior and user-generated content: presentation at the industrial session - EDBT/ICDT 2012

Data management with SAPs in-memory computing engine

Distributed skyline processing: a trend in database research still going strong

Tailoring entity resolution for matching product offers

Indexing and mining topological patterns for drug discovery

Towards principled design support for scalable OLTP workloads

Adaptive indexing in modern database kernels

A probabilistic convex hull query tool

ColisTrack: testbed for a pervasive environment management system

The mainframe strikes back: elastic multi-tenancy using main memory database systems on a many-core server

SOS (save our systems): a uniform programming interface for non-relational systems

PeerTrack: a platform for tracking and tracing objects in large-scale traceability networks

Fault-tolerant complex event processing using customizable state machine-based operators

Knowledge-based processing of complex stock market events

Private-HERMES: a benchmark framework for privacy-preserving mobility data querying and mining methods

Evaluating hybrid queries through service coordination in HYPATIA

A desktop interface over distributed document repositories

SPARQL-RW: transparent query access over mapped RDF data sources

Intention insider: discovering people's intentions in the social channel

QUASAR: querying annotation, structure, and reasoning

Realtime healthcare services via nested complex event processing technology

Distributed data management for large-scale wireless sensor networks simulations

Knowing: a generic data analysis application

Shortest-path queries for complex networks: exploiting low tree-width outside the core

Content Provider	ACM Digital Library
Author	Kawarabayashi, Ken-ichi Akiba, Takuya Sommer, Christian
Abstract	We present new and improved methods for efficient shortest-path query processing. Our methods are tailored to work for two specific classes of graphs: graphs with small tree-width and complex networks. Seemingly unrelated at first glance, these two classes of graphs have some commonalities: complex networks are known to have a core--fringe structure with a dense core and a tree-like fringe. Our main contributions are efficient algorithms and data structures on three different levels. First, we provide two new methods for graphs with small but not necessarily constant tree-width. Our methods achieve new tradeoffs between space and query time. Second, we present an improved tree-decomposition-based method for complex networks, utilizing the methods for graphs with small tree-width. Third, we extend our method to handle the highly inter-connected core with existing exact and approximate methods. We evaluate our algorithms both analytically and experimentally. We prove that our algorithms for low-tree-width graphs achieve improved tradeoffs between space and query time. Our experiments on several real-world complex networks further confirm the efficiency of our methods: Both the exact and the hybrid method have faster preprocessing and query times than existing methods. The hybrid method in particular provides an improved tradeoff between space and accuracy.
Starting Page	144
Ending Page	155
Page Count	12
File Format	PDF
ISBN	9781450307901
DOI	10.1145/2247596.2247614
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-03-27
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Query processing Complex networks Graphs Shortest paths
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Shortest-path queries for complex networks: exploiting low tree-width outside the core.

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

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling

Pruned labeling algorithms: fast, exact, dynamic, simple and general indexing scheme for shortest-path queries

Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks

CORE Analysis for Efficient Shortest Path Traversal Queries in Social Graphs

TEDI: efficient shortest path query answering on graphs

Efficient temporal shortest path queries on evolving social graphs

Efficient processing of distance queries in large graphs: a vertex cover approach

Shortest-path queries for complex networks: exploiting low tree-width outside the core

Similar Documents

Shortest-path queries for complex networks: exploiting low tree-width outside the core.

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

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling

Pruned labeling algorithms: fast, exact, dynamic, simple and general indexing scheme for shortest-path queries

Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks

CORE Analysis for Efficient Shortest Path Traversal Queries in Social Graphs

TEDI: efficient shortest path query answering on graphs

Efficient temporal shortest path queries on evolving social graphs

Efficient processing of distance queries in large graphs: a vertex cover approach

Shortest-path queries for complex networks: exploiting low tree-width outside the core