research-article

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

Authors:

Kamalas Udomlamlert,

Cosmas Krisna Adiputra,

Takahiro HaraAuthors Info & Claims

DEBS '16: Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems

Pages 317 - 321

https://doi.org/10.1145/2933267.2933510

Published: 13 June 2016 Publication History

Get Access

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.

Digital Library

Google Scholar

[2]

P. Prosser. Exact algorithms for maximum clique: A computational study. Algorithms, 5(4):545--587, 2012.

Crossref

Google Scholar

[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.

Digital Library

Google Scholar

Index Terms

Monitoring top-k on real-time dynamic social-network graphs
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Data model extensions
        Data streams
  2. Information retrieval
    1. Retrieval models and ranking
      1. Top-k retrieval in databases
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Software architectures
        Publish-subscribe / event-based architectures

Recommendations

Top-k best probability queries and semantics ranking properties on probabilistic databases

There has been much interest in answering top-k queries on probabilistic data in various applications such as market analysis, personalized services, and decision making. In probabilistic relational databases, the most common problem in answering top-k ...
Uncertain top-k query processing in distributed environments

The top-k query on uncertain data set has been a very hot topic these years, and there have been many studies on uncertain top-k queries. Unfortunately, most of the existing algorithms only consider centralized processing environments, and they are not ...
Top-k best probability queries on probabilistic data
DASFAA'12: Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II

There has been much interest in answering top-k queries on probabilistic data in various applications such as market analysis, personalised services, and decision making. In relation to probabilistic data, the most common problem in answering top-k ...

Comments

Information & Contributors

Information

Published In

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

General Chairs:
Avigdor Gal
Technion, Israel
,
Matthias Weidlich
Humboldt-Universität zu Berlin, Germany
,
Program Chairs:
Vana Kalogeraki
Athens University of Economics and Business, Greece
,
Nalini Venkasubramanian
University of California, Irvine

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

DEBS '16

Sponsor:

DEBS '16: The 10th ACM International Conference on Distributed and Event-based Systems

June 20 - 24, 2016

California, Irvine

Acceptance Rates

Overall Acceptance Rate 145 of 583 submissions, 25%

Upcoming Conference

Contributors

Other Metrics

View Article 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

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Index Terms

Recommendations

Top-k best probability queries and semantics ranking properties on probabilistic databases

Uncertain top-k query processing in distributed environments

Top-k best probability queries on probabilistic data

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations