Article

Mining approximate functional dependencies and concept similarities to answer imprecise queries

Authors:

Subbarao KambhampatiAuthors Info & Claims

WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004

Pages 73 - 78

https://doi.org/10.1145/1017074.1017093

Published: 17 June 2004 Publication History

Abstract

Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we focus on providing a domain and end-user independent solution for supporting imprecise queries over Web databases without affecting the underlying database. We propose a query processing framework that integrates techniques from IR and database research to efficiently determine answers for imprecise queries. We mine and use approximate functional dependencies between attributes to create precise queries having tuples relevant to the given imprecise query. An approach to automatically estimate the semantic distances between values of categorical attributes is also proposed. We provide preliminary results showing the utility of our approach.

References

[1]

BibFinder: A Computer Science Bibliography Mediator. Available at :http://kilimanjaro.eas.asu.edu/.]]

[2]

R. Baeza-Yates and B. Ribiero-Neto. Modern Information Retrieval. Addison Wesley Longman Publishing, 1999.]]

Digital Library

[3]

C. Buckley, G. Salton, and J. Allan. Automatic Retrieval with Locality Information Using Smart. TREC-1, National Institute of Standards and Technology, Gaithersburg, MD, 1992.]]

[4]

W. W. Chu, Q. Chen, and R. Lee. Cooperative query answering via type abstraction hierarchy. Cooperative Knowledge Based Systems, pages 271--290, 1991.]]

[5]

W. W. Chu, Q. Chen, and R. Lee. A structured approach for cooperative query answering. IEEE TKDE, 1992.]]

Digital Library

[6]

W. Cohen. Integration of heterogeneous databases without common domains using queries based on textual similarity. Proc. of SIGMOD, pages 201--212, June 1998.]]

Digital Library

[7]

M. Dalkilic and E. Robertson. Information Dependencies. In Proc. of PODS, 2000.]]

Digital Library

[8]

N. E. Efthimiadis. Query Expansion. In Annual Review of Information Systems and Technology, Vol. 31, pages 121--187, 1996.]]

[9]

R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Garcia-Molina. Proximity search in databases. VLDB, 1998.]]

Digital Library

[10]

T. Haveliwala, A. Gionis, D. Klein, and P Indyk. Evaluating strategies for similarity search on the web. Proceedings of WWW, Hawai, USA, May 2002.]]

Digital Library

[11]

Y. Huhtala, J. Krkkinen, P. Porkka, and H. Toivonen. Efficient discovery of functional and approximate dependencies using partitions. Proceedings of ICDE, 1998.]]

Digital Library

[12]

J. Kivinen and H. Mannila. Approximate Dependency Inference from Relations. Theoretical Computer Science, 1995.]]

Digital Library

[13]

T. Lee. An information-theoretic analysis of relational databases-part I: Data Dependencies and Information Metric. IEEE Transactions on Software Engineering SE-13, October 1987.]]

Digital Library

[14]

J. M. Morrissey. Imprecise information and uncertainty in information systems. ACM Transactions on Information Systems, 8:159--180, April 1990.]]

Digital Library

[15]

A. Motro. Flex: A tolerant and cooperative user interface to database. IEEE TKDE, pages 231--245, 1990.]]

Digital Library

[16]

A. Motro. Vague: A user interface to relational databases that permits vague queries. ACM Transactions on Office Information Systems, 6(3):187--214, 1998.]]

Digital Library

[17]

K. Nambiar. Some analytic tools for the Design of Relational Database Systems. In Proc. of 6th VLDB, 1980.]]

[18]

U. Nambiar and S. Kambhampati. Providing ranked relevant results for web database queries. To appear in WWW Posters 2004, May 17--22, 2004.]]

Digital Library

[19]

U. Nambiar and S. Kambhampati. Answering imprecise database queries: A novel approach. ACM Workshop on Web Information and Data Management, November 2003.]]

Digital Library

[20]

Yahoo! autos. Available at http://autos.yahoo.com/.]]

[21]

Z. Nie, S. Kambhampati, and T. Hernandez. BibFinder/StatMiner: Effectively Mining and Using Coverage and Overlap Statistics in Data Integration. In Proc. of VLDB, 2003.]]

Digital Library

[22]

M. Ortega-Binderberger. Integrating Similarity Based Retrieval and Query Refinement in Databases. PhD thesis, UIUC, 2003.]]

Digital Library

Cited By

Caruccio LCirillo SIuliano GPolese GStanzione R(2024)RYAN: A tool for explaining and visually analyzing the evolution of Relaxed Functional Dependencies2024 IEEE International Conference on Big Data (BigData)10.1109/BigData62323.2024.10826143(1249-1254)Online publication date: 15-Dec-2024
https://doi.org/10.1109/BigData62323.2024.10826143
Faure-Giovagnoli PPetit JScuturici V(2022)Assessing the Existence of a Function in a Dataset with the g3 Indicator2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00050(607-620)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00050
Caruccio LDeufemia VNaumann FPolese G(2021)Discovering Relaxed Functional Dependencies Based on Multi-Attribute DominanceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.296772233:9(3212-3228)Online publication date: 1-Sep-2021
https://doi.org/10.1109/TKDE.2020.2967722
Show More Cited By

Mining approximate functional dependencies and concept similarities to answer imprecise queries
1. Information systems
  1. Data management systems
    1. Database management system engines
  2. Information retrieval
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Answering imprecise database queries: a novel approach
WIDM '03: Proceedings of the 5th ACM international workshop on Web information and data management

A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfaces that hide the underlying schematic details. Constrained by the ...
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
SAC '06: Proceedings of the 2006 ACM symposium on Applied computing

Traditional semantic web query languages support a logic-based access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and in databases, however, exact querying often provides an incomplete answer ...
Mining frequent conjunctive queries using functional and inclusion dependencies

We address the issue of mining frequent conjunctive queries in a relational database, a problem known to be intractable even for conjunctive queries over a single table. In this article, we show that mining frequent projection-selection-join queries ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

WebDB '04: Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004

June 2004

100 pages

ISBN:9781450377881

DOI:10.1145/1017074

Conference Chairs:
Luis Gravano,
Sihem Amer-Yahia

Copyright © 2004 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]

Sponsors

INRIA: Institut Natl de Recherche en Info et en Automatique

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

WebDB04

Sponsor:

INRIA

WebDB04: 7th International Workshop on the Web and Databases

June 17 - 18, 2004

Paris, France

Acceptance Rates

Overall Acceptance Rate 30 of 100 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
343
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)5

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Caruccio LCirillo SIuliano GPolese GStanzione R(2024)RYAN: A tool for explaining and visually analyzing the evolution of Relaxed Functional Dependencies2024 IEEE International Conference on Big Data (BigData)10.1109/BigData62323.2024.10826143(1249-1254)Online publication date: 15-Dec-2024
https://doi.org/10.1109/BigData62323.2024.10826143
Faure-Giovagnoli PPetit JScuturici V(2022)Assessing the Existence of a Function in a Dataset with the g3 Indicator2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00050(607-620)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00050
Caruccio LDeufemia VNaumann FPolese G(2021)Discovering Relaxed Functional Dependencies Based on Multi-Attribute DominanceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.296772233:9(3212-3228)Online publication date: 1-Sep-2021
https://doi.org/10.1109/TKDE.2020.2967722
Bhattacharya AChoudhury S(2021)Automated Query Relaxation Mechanism for QoS-Aware Service ProvisioningArabian Journal for Science and Engineering10.1007/s13369-021-05978-w47:2(1717-1732)Online publication date: 18-Aug-2021
https://doi.org/10.1007/s13369-021-05978-w
Kossmann JPapenbrock TNaumann F(2021)Data dependencies for query optimization: a surveyThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-021-00676-331:1(1-22)Online publication date: 14-Jun-2021
https://dl.acm.org/doi/10.1007/s00778-021-00676-3
Mohamed Mostafa MVucetic MStojkovic NLekić NMakarov A(2019)Fuzzy Functional Dependencies as a Method of Choice for Fusion of AIS and OTHR DataSensors10.3390/s1923516619:23(5166)Online publication date: 26-Nov-2019
https://doi.org/10.3390/s19235166
Caruccio LDeufemia VPolese G(2019)Mining relaxed functional dependencies from dataData Mining and Knowledge Discovery10.1007/s10618-019-00667-7Online publication date: 23-Dec-2019
https://doi.org/10.1007/s10618-019-00667-7
Kruse SNaumann F(2018)Efficient discovery of approximate dependenciesProceedings of the VLDB Endowment10.14778/3192965.319296811:7(759-772)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.14778/3192965.3192968
Caruccio LDeufemia VPolese G(2017)Learning Effective Query Management Strategies from Big Data2017 16th IEEE International Conference on Machine Learning and Applications (ICMLA)10.1109/ICMLA.2017.00-88(643-648)Online publication date: Dec-2017
https://doi.org/10.1109/ICMLA.2017.00-88
Caruccio LDeufemia VPolese GDesai BToyama MBernardino J(2016)On the Discovery of Relaxed Functional DependenciesProceedings of the 20th International Database Engineering & Applications Symposium10.1145/2938503.2938519(53-61)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.1145/2938503.2938519
Show More Cited By

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.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten