skip to main content
10.1145/2933267.2933510acmconferencesArticle/Chapter ViewAbstractPublication PagesdebsConference Proceedingsconference-collections
research-article

Monitoring top-k on real-time dynamic social-network graphs

Published: 13 June 2016 Publication History

Abstract

This paper presents our solution to 2016 DEBS Grand Challenge. We proposed our original program to efficiently calculate 2 continuous top-k queries on real-time social-network graph data. Our implementation tried to prevent processing of unaffected events by designing the algorithms to efficiently maintain the spare list of candidates of the top-k results. In addition, we improved the efficiency of the state-of-the-art algorithms to speed up the processing of the queries.

References

[1]
V. Gulisano, Z. Jerzak, S. Voulgaris, and H. Ziekow. The DEBS 2016 Grand Challenge. In DEBS. ACM, 2016.
[2]
P. Prosser. Exact algorithms for maximum clique: A computational study. Algorithms, 5(4):545--587, 2012.
[3]
E. Tomita, Y. Sutani, T. Higashi, S. Takahashi, and M. Wakatsuki. A simple and faster branch-and-bound algorithm for finding a maximum clique. In WALCOM: Algorithms and computation, pages 191--203. Springer, 2010.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DEBS '16: Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems
June 2016
456 pages
ISBN:9781450340212
DOI:10.1145/2933267
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. event-based processing
  2. social graphs
  3. top-k query

Qualifiers

  • Research-article

Conference

DEBS '16

Acceptance Rates

Overall Acceptance Rate 145 of 583 submissions, 25%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 156
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media