Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3183713.3193550acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article
Public Access

GExp: Cost-aware Graph Exploration with Keywords

Published: 27 May 2018 Publication History

Abstract

We demonstrate GExp, an interactive graph exploration tool that uses keywords to support effective access and exploration of large graphs. GExp interleaves keyword query suggestion, which generates keyword queries that expand the original query, and query evaluation, that returns the answers to suggested queries for feedback. It advocates (1) cost-aware exploration, which suggests keyword queries that have low answer cost (thus high answer quality), and (2) incremental query evaluation to update the query answers with a bounded time cost. It differs from prior systems in its ability to identify and leverage substructures that augment original answers for query expansion and evaluation with provable cost bounds. A unique feature of GExp is that users can trade the quality of query answers with their evaluation cost by tuning the bound of answer cost in an ad-hoc manner. We demonstrate how GExp supports graph exploratory with three established keyword query classes with bounded time cost, and guarantees on result quality, using real-world knowledge bases and information networks.

References

[1]
Full version. http://eecs.wsu.edu/~mnamaki/GExplorer_Full.pdf.
[2]
Gexp. https://github.com/mhnamaki/GExp.
[3]
Z. Bao, Y. Zeng, H. Jagadish, and T. W. Ling. Exploratory keyword search with interactive input. In SIGMOD, pages 871--876, 2015.
[4]
A. Bouchoucha, J. He, and J.-Y. Nie. Diversified query expansion using conceptnet. In CIKM, pages 1861--1864, 2013.
[5]
C. Carpineto and G. Romano. A survey of automatic query expansion in information retrieval. CSUR, 2012.
[6]
B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding top-k min-cost connected trees in databases. In ICDE, pages 836--845, 2007.
[7]
W. Fan, X. Wang, and Y. Wu. Incremental graph pattern matching. TODS, 2013.
[8]
S. Gollapudi and A. Sharma. An axiomatic approach for result diversification. In WWW, pages 381--390, 2009.
[9]
V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005.
[10]
M. Kargar and A. An. Keyword search in graphs: Finding r-cliques. VLDB, 2011.
[11]
M. H. Namaki, P. Lin, and Y. Wu. Event pattern discovery by keywords in graph streams. In IEEE Big Data, pages 982--987, 2017.
[12]
M. H. Namaki, K. Sasani, Y. Wu, and T. Ge. Beams: Bounded event detection in graph streams. In ICDE, pages 1387--1388, 2017.
[13]
N. Sarkas, N. Bansal, G. Das, and N. Koudas. Measure-driven keyword-query expansion. PVLDB, pages 121--132, 2009.
[14]
Q. Song, Y. Wu, and X. L. Dong. Mining summaries for knowledge graph search. In ICDM, pages 1215--1220, 2016.
[15]
J. X. Yu, L. Qin, and L. Chang. Keyword search in relational databases: A survey. IEEE Data Eng. Bull., pages 67--78, 2010.

Cited By

View all
  • (2024)A Fast Hop-Biased Approximation Algorithm for the Quadratic Group Steiner Tree ProblemProceedings of the ACM Web Conference 202410.1145/3589334.3645325(312-321)Online publication date: 13-May-2024
  • (2022)Answering Why-Questions for Subgraph QueriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.304643634:10(4636-4649)Online publication date: 1-Oct-2022
  • (2022)Top-k star queries on knowledge graphs through semantic-aware bounding match scoresKnowledge-Based Systems10.1016/j.knosys.2020.106655213:COnline publication date: 23-Apr-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD '18: Proceedings of the 2018 International Conference on Management of Data
May 2018
1874 pages
ISBN:9781450347037
DOI:10.1145/3183713
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: 27 May 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. graph database
  2. keyword search
  3. query expansion
  4. query suggestion

Qualifiers

  • Research-article

Funding Sources

Conference

SIGMOD/PODS '18
Sponsor:

Acceptance Rates

SIGMOD '18 Paper Acceptance Rate 90 of 461 submissions, 20%;
Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)52
  • Downloads (Last 6 weeks)23
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)A Fast Hop-Biased Approximation Algorithm for the Quadratic Group Steiner Tree ProblemProceedings of the ACM Web Conference 202410.1145/3589334.3645325(312-321)Online publication date: 13-May-2024
  • (2022)Answering Why-Questions for Subgraph QueriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.304643634:10(4636-4649)Online publication date: 1-Oct-2022
  • (2022)Top-k star queries on knowledge graphs through semantic-aware bounding match scoresKnowledge-Based Systems10.1016/j.knosys.2020.106655213:COnline publication date: 23-Apr-2022
  • (2020)Kronos: Lightweight Knowledge-based Event Analysis in Cyber-Physical Data Streams2020 IEEE 36th International Conference on Data Engineering (ICDE)10.1109/ICDE48307.2020.00165(1766-1769)Online publication date: Apr-2020
  • (2020)Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs2020 IEEE 36th International Conference on Data Engineering (ICDE)10.1109/ICDE48307.2020.00045(445-456)Online publication date: Apr-2020
  • (2020)A survey of typical attributed graph queriesWorld Wide Web10.1007/s11280-020-00849-024:1(297-346)Online publication date: 20-Nov-2020
  • (2020)FERRARI: an efficient framework for visual exploratory subgraph search in graph databasesThe VLDB Journal10.1007/s00778-020-00601-029:5(973-998)Online publication date: 30-Jan-2020
  • (2019)An Indexing Framework for Efficient Visual Exploratory Subgraph Search in Graph Databases2019 IEEE 35th International Conference on Data Engineering (ICDE)10.1109/ICDE.2019.00168(1666-1669)Online publication date: Apr-2019
  • (2018)Diversified Keyword Expansion on Multi-labeled GraphsWeb and Big Data10.1007/978-3-319-96890-2_19(219-235)Online publication date: 19-Jul-2018

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media