NDLI: Index design and query processing for graph conductance search

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

Index design and query processing for graph conductance search

Content Provider	Springer Nature Link
Author	Chakrabarti, Soumen Pathak, Amit Gupta, Manish
Copyright Year	2010
Abstract	Graph conductance queries, also known as personalized PageRank and related to random walks with restarts, were originally proposed to assign a hyperlink-based prestige score to Web pages. More general forms of such queries are also very useful for ranking in entity-relation (ER) graphs used to represent relational, XML and hypertext data. Evaluation of PageRank usually involves a global eigen computation. If the graph is even moderately large, interactive response times may not be possible. Recently, the need for interactive PageRank evaluation has increased. The graph may be fully known only when the query is submitted. Browsing actions of the user may change some inputs to the PageRank computation dynamically. In this paper, we describe a system that analyzes query workloads and the ER graph, invests in limited offline indexing, and exploits those indices to achieve essentially constant-time query processing, even as the graph size scales. Our techniques—data and query statistics collection, index selection and materialization, and query-time index exploitation—have parallels in the extensive relational query optimization literature, but is applied to supporting novel graph data repositories. We report on experiments with five temporal snapshots of the CiteSeer ER graph having 74–702 thousand entity nodes, 0.17–1.16 million word nodes, 0.29–3.26 million edges between entities, and 3.29–32.8 million edges between words and entities. We also used two million actual queries from CiteSeer’s logs. Queries run 3–4 orders of magnitude faster than whole-graph PageRank, the gap growing with graph size. Index size is smaller than a text index. Ranking accuracy is 94–98% with reference to whole-graph PageRank.
Starting Page	445
Ending Page	470
Page Count	26
File Format	PDF
ISSN	10668888
Journal	The VLDB Journal
Volume Number	20
Issue Number	3
e-ISSN	0949877X
Language	English
Publisher	Springer-Verlag
Publisher Date	2010-10-16
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Personalized PageRank Graph conductance Proximity search in graph databases Database Management
Content Type	Text
Resource Type	Article
Subject	Information Systems Hardware and Architecture

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

Fast graph query processing with a low-cost index

Graph similarity search on large uncertain graph databases

AutoG: a visual query autocompletion framework for graph databases

Lindex: a lattice-based index for graph databases

The Stratosphere platform for big data analytics

MyBenchmark: generating databases for query workloads

GRAIL: a scalable index for reachability queries in very large graphs

Three-Level Caching for Efficient Query Processing in Large Web Search Engines

Scheduled approximation for Personalized PageRank with Utility-based Hub Selection

Index design and query processing for graph conductance search

Similar Documents

Fast graph query processing with a low-cost index

Graph similarity search on large uncertain graph databases

AutoG: a visual query autocompletion framework for graph databases

Lindex: a lattice-based index for graph databases

The Stratosphere platform for big data analytics

MyBenchmark: generating databases for query workloads

GRAIL: a scalable index for reachability queries in very large graphs

Three-Level Caching for Efficient Query Processing in Large Web Search Engines

Scheduled approximation for Personalized PageRank with Utility-based Hub Selection

Index design and query processing for graph conductance search