research-article

Free access

Flexible query answering on graph-modeled data

Authors:

Federica Mandreoli,

Riccardo Martoglia,

Giorgio Villani,

Wilma PenzoAuthors Info & Claims

EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

Pages 216 - 227

https://doi.org/10.1145/1516360.1516386

Published: 24 March 2009 Publication History

Abstract

The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete knowledge of the vocabulary used, as well as of the information about the structural relationships between the data.

To overcome these problems, flexible query answering capabilities are an essential need. In this paper we present a general model for supporting approximate queries on graph-modeled data. Approximation is both on the vocabularies and the structure. The model is general in that it is not bound to a specific graph data model, rather it gracefully accommodates labeled directed/undirected data graphs with labeled/unlabeled edges. The query answering principles underlying the model are not compelled to a specific data graph, instead they are founded on properties inferable from the data model the data graph conforms to. We complement the work with a ranking model to deal with data approximations and with an efficient top-k retrieval algorithm which smartly accesses ad-hoc data structures and generates the most promising answers in an order correlated with the ranking measures. Experimental results prove the good effectiveness and efficiency of our proposal on different real world datasets.

References

[1]

S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: A System for Keyword-Based Search over Relational Databases. In ICDE, 2002.

Digital Library

[2]

S. Amer-Yahia, L. Lakshmanan, and S. Pandit. FleXPath: Flexible Structure and Full-Text Querying for XML. In SIGMOD, pages 83--94, 2004.

Digital Library

[3]

G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword Searching and Browsing in Databases using BANKS. In ICDE, 2002.

Digital Library

[4]

S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. XSEarch: A Semantic Search Engine for XML. In VLDB, 2003.

Digital Library

[5]

X. Dong and A. Halevy. Indexing dataspaces. In SIGMOD, 2007.

Digital Library

[6]

R. Fagin, A. Lotem, and M. Naor. Optimal Aggregation Algorithms for Middleware. In PODS, 2001.

Digital Library

[7]

G. Furnas, T. Landauer, L. Gomez, and S. Dumais. The vocabulary problem in human-system communication. Commun. ACM, 30(11):964--971, 1987.

Digital Library

[8]

L. Guo, J. Shanmugasundaram, and G. Yona. Topology Search over Biological Databases. In ICDE, 2007.

[9]

H. He, H. Wang, J. Yang, and P. Yu. BLINKS: ranked keyword searches on graphs. In SIGMOD, 2007.

Digital Library

[10]

V. Hristidis, N. Koudas, Y. Papakonstantinou, and D. Srivastava. Keyword Proximity Search in XML Trees. IEEE Trans. Knowl. Data Eng., 18(4), 2006.

Digital Library

[11]

V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional Expansion For Keyword Search on Graph Databases. In VLDB, 2005.

Digital Library

[12]

G. Kasneci, F. Suchanek, G. Ifrim, M. Ramanath, and G. Weikum. NAGA: Searching and Ranking Knowledge. In ICDE, 2007.

[13]

C. Leacock and M. Chodorow. Combining Local Context and WordNet Similarity for Word Sense Identification. In C. Fellbaum, editor, WordNet: An Electronic Lexical Database, pages 256--283. MIT Press, 1998.

[14]

G. Li, B. Ooi, J. Feng, J. Wang, and L. Zhou. EASE: An Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data. In SIGMOD, 2008.

Digital Library

[15]

F. Mandreoli, R. Martoglia, and E. Ronchetti. Versatile Structural Disambiguation for Semantic-Aware Applications. In CIKM, 2005.

Digital Library

[16]

A. Simitsis, G. Koutrika, and Y. Ioannidis. Précis: from unstructured keywords as queries to structured databases as answers. VLDB J., 17(1):117--149, 2008.

Digital Library

[17]

F. Suchanek, G. Kasneci, and G. Weikum. Yago: a core of semantic knowledge. In WWW, 2007.

Digital Library

[18]

Y. Tian and J. Patel. TALE: A Tool for Approximate Large Graph Matching. In ICDE, 2008.

Digital Library

[19]

Y. Xu and Y. Papakonstantinou. Efficient Keyword Search for Smallest LCAs in XML Databases. In SIGMOD, 2005.

Digital Library

[20]

X. Yan, P. Yu, and J. Han. Substructure Similarity Search in Graph Databases. In SIGMOD, 2005.

Digital Library

[21]

C. Yu and H. Jagadish. Querying Complex Structured Databases. In VLDB, 2007.

Digital Library

[22]

X. Zhou, J. Gaugaz, W.-T. Balke, and W. Nejdl. Query relaxation using malleable schemas. In SIGMOD, 2007.

Digital Library

Cited By

Frosini RPoulovassilis AWood PCalí A(2022)Optimisation Techniques for Flexible SPARQL QueriesACM Transactions on the Web10.1145/353285516:4(1-44)Online publication date: 16-Nov-2022
https://dl.acm.org/doi/10.1145/3532855
Formica AMazzei MPourabbas ERafanelli M(2020)Approximate Query Answering Based on Topological Neighborhood and Semantic Similarity in OpenStreetMapIEEE Access10.1109/ACCESS.2020.29922028(87011-87030)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2992202
Fletcher GPoulovassilis ASelmer PWood P(2019)Approximate Querying for the Property Graph Language Cypher2019 IEEE International Conference on Big Data (Big Data)10.1109/BigData47090.2019.9005466(617-622)Online publication date: Dec-2019
https://doi.org/10.1109/BigData47090.2019.9005466
Show More Cited By

Flexible query answering on graph-modeled data
1. Information systems
  1. Data management systems
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Approximating expressive queries on graph-modeled data

We present GeX for the approximate matching of complex queries on graph-modeled data.GeX generalizes existing approaches and allows for querying any graph-based datasets.GeX query language supports queries ranging from keyword-based to complex ones.GeX ...
Flexible Query Answering over Graph-modeled Data
SIGMOD '15 PhD Symposium: Proceedings of the 2015 ACM SIGMOD on PhD Symposium

The lack of familiarity that users have with information systems has led to different flexible methods to access data (keyword search, faceted search, similarity search, etc.). Since flexible query answering techniques differ from one another, their ...
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01: Revised Papers from the 8th International Workshop on Database Programming Languages

The basic querying mechanism over semistructured data, namely regular path queries, asks for all pairs of objects that are connected by a path conforming to a regular expression. We consider conjunctive two-way regular path queries (C2RPQ_c's), which ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

March 2009

1180 pages

ISBN:9781605584225

DOI:10.1145/1516360

Editors:
Martin Kersten
CWI, The Netherlands
,
Boris Novikov
University of Saint Petersburg, Russia
,
Jens Teubner
ETH Zurich, Switzerland
,
Vladimir Polutin
HP Labs, Russia
,
Stefan Manegold
CWI, The Netherlands

Copyright © 2009 ACM.

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: 24 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

EDBT/ICDT '09

EDBT/ICDT '09: EDBT/ICDT '09 joint conference

March 24 - 26, 2009

Saint Petersburg, Russia

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
519
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)4

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Frosini RPoulovassilis AWood PCalí A(2022)Optimisation Techniques for Flexible SPARQL QueriesACM Transactions on the Web10.1145/353285516:4(1-44)Online publication date: 16-Nov-2022
https://dl.acm.org/doi/10.1145/3532855
Formica AMazzei MPourabbas ERafanelli M(2020)Approximate Query Answering Based on Topological Neighborhood and Semantic Similarity in OpenStreetMapIEEE Access10.1109/ACCESS.2020.29922028(87011-87030)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2992202
Fletcher GPoulovassilis ASelmer PWood P(2019)Approximate Querying for the Property Graph Language Cypher2019 IEEE International Conference on Big Data (Big Data)10.1109/BigData47090.2019.9005466(617-622)Online publication date: Dec-2019
https://doi.org/10.1109/BigData47090.2019.9005466
Poulovassilis A(2018)Applications of Flexible Querying to Graph DataGraph Data Management10.1007/978-3-319-96193-4_4(97-142)Online publication date: 1-Nov-2018
https://doi.org/10.1007/978-3-319-96193-4_4
Castelltort ALaurent APivert OSlama OThion V(2018)Fuzzy Preference Queries to NoSQL Graph DatabasesNoSQL Data Models10.1002/9781119528227.ch6(167-201)Online publication date: 6-Aug-2018
https://doi.org/10.1002/9781119528227.ch6
Bergamaschi SBeneventano DMandreoli FMartoglia RGuerra FOrsini MPo LVincini MSimonini GZhu SGagliardelli LMagnotta L(2017)From Data Integration to Big Data IntegrationA Comprehensive Guide Through the Italian Database Research Over the Last 25 Years10.1007/978-3-319-61893-7_3(43-59)Online publication date: 31-May-2017
https://doi.org/10.1007/978-3-319-61893-7_3
Liu JYan D(2016)Answering Approximate Queries Over XML DataIEEE Transactions on Fuzzy Systems10.1109/TFUZZ.2015.245316824:2(288-305)Online publication date: Apr-2016
https://doi.org/10.1109/TFUZZ.2015.2453168
(2016)Approximation and relaxation of semantic web path queriesWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2016.08.00140:C(1-21)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1016/j.websem.2016.08.001
Thiele MVasilyeva EBornhövd CLehner W(2015)Considering User Intention in Differential Graph QueriesJournal of Database Management10.4018/JDM.201507010226:3(21-40)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.4018/JDM.2015070102
Vasilyeva EThiele MMocan ALehner W(2015)Relaxation of subgraph queries delivering empty resultsProceedings of the 27th International Conference on Scientific and Statistical Database Management10.1145/2791347.2791382(1-12)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1145/2791347.2791382
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Table of Contents