NDLI: Efficient Multiview Maintenance under Insertion in Huge Social Networks

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

Efficient Multiview Maintenance under Insertion in Huge Social Networks

Content Provider	ACM Digital Library
Author	Bröcheler, Matthias Subrahmanian, V. S. Ovelgönne, Michael Pugliese, Andrea
Copyright Year	2014
Abstract	Applications to monitor various aspects of social networks are becoming increasingly popular. For instance, marketers want to look for semantic patterns relating to the content of tweets and Facebook posts relating to their products. Law enforcement agencies want to track behaviors involving potential criminals on the Internet by looking for certain patterns of behavior. Music companies want to track patterns of spread of illegal music. These applications allow multiple users to specify patterns of interest and monitor them in real time as new data gets added to the Web or to a social network. In this article we develop the concept of social network view servers in which all of these types of applications can be simultaneously monitored. The patterns of interest are expressed as views over an underlying graph or social network database. We show that a given set of views can be $\textit{compiled}$ in multiple possible ways to take advantage of common substructures and define the concept of an optimal merge. Though finding an optimal merge is shown to be NP-hard, we develop the AddView to find very good merges quickly. We develop a very fast MultiView algorithm that scalably and efficiently maintains multiple subgraph views when insertions are made to the social network database. We show that our algorithm is correct, study its complexity, and experimentally demonstrate that our algorithm can scalably handle updates to hundreds of views on 6 real-world social network databases with up to 540M edges.
Starting Page	1
Ending Page	32
Page Count	32
File Format	PDF
ISSN	15591131
e-ISSN	1559114X
DOI	10.1145/2541290
Volume Number	8
Issue Number	2
Journal	ACM Transactions on the Web (TWEB)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-03-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	View maintenance Graph matching Social network databases
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

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

Unbiased sampling in directed social graph

Incremental view maintenance in object-oriented databases

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Finding email correspondents in online social networks

Socially enabled wireless networks: resource allocation via bipartite graph matching

SocialSearch $^{ + }$: enriching social network with web evidences

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

Efficient view maintenance in wireless networks [mobile database view maintenance applications]

Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks

Efficient Multiview Maintenance under Insertion in Huge Social Networks

Similar Documents

Unbiased sampling in directed social graph

Incremental view maintenance in object-oriented databases

Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

Finding email correspondents in online social networks

Socially enabled wireless networks: resource allocation via bipartite graph matching

SocialSearch $^{ + }$: enriching social network with web evidences

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

Efficient view maintenance in wireless networks [mobile database view maintenance applications]

Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks

Efficient Multiview Maintenance under Insertion in Huge Social Networks