AUTOJOIN: PROVIDING FREEDOM FROM SPECIFYING JOINS

Terrence Mason, Lixin Wang, Ramon Lawrence

Abstract

SQL is not appropriate for casual users as it requires understanding relational schemas and how to construct joins. Many new query interfaces insulate users from the logical structure of the database, but they require the automatic discovery of valid joins. Although specific query interfaces implement join determination algorithms, they are tied to the specific language and typically limited in scope or scalability. AutoJoin provides a general solution to the query inference problem, which allows more complex queries to be executed on larger and more complicated schemas. It enumerates query interpretations at least an order of magnitude faster than previous methods. In addition, the engine reduces the number of queries considered ambiguous. Experimental results demonstrate that query inference can be efficiently performed on large, complex schemas allowing simpler access to databases through keyword search or conceptual query languages. AutoJoin also provides programmers with a tool to iteratively create SQL queries without requiring explicit knowledge of the structure of a database.

References

  1. Agrawal, S., Chaudhuri, S., and Das, G. (2002). DBXplorer:A System for Keyword-Based Search Over Relational Databases. In IEEE ICDE, pages 5-16.
  2. Balmin, A., Hristidis, V., and Papakonstantinou, Y. (2004). ObjectRank:Authority-Based Keyword Search in Databases. In VLDB, pages 564-575.
  3. Catarci, T. (2000). What happend when Database Researchers met Usability. Information Systems, 25(3):177-212.
  4. Gabow, H. and Myers, E. (1978). Finding All Spanning Trees of Directed and Undirected Graphs. SIAM Journal of Computing, 7(3):280-287.
  5. Hristidis, V. and Papakonstantinou, Y. (2002). DISCOVER:Keyword Search in Relational Datbases. In VLDB, pages 670-681.
  6. Maier, D. and Ullman, J. (1983). Maximal Objects and the Semantics of Universal Relation Databases. TODS, 8(1):1-14.
  7. Owei, V. and Navathe, S. (2001). Enriching the conceptual basis for query formulation through relationship semantics in databases. Information Systems, 26(6):445-475.
  8. Popescu, A., Etzioni, O., and Kautz, H. (2003). Towards a theory of natural language interfaces to databases. In IUI.
  9. Semmel, R. and Mayfield, J. (1997). Automated Query Formulation using an Entity-Relationship Conceptual Schema. Intelligent Information Systems, 8:267-290.
  10. Wald, J. and Sorenson, P. (1984). Resolving the Query Inference Problem Using Steiner Trees. TODS, 9(3):348-368.
  11. Zhang, G., Meng, F., Kong, G., and Chu, W. (1999). Query Formulation from High-level Concepts for Databases. In User Interfaces to Data Intensive Systems.
Download


Paper Citation


in Harvard Style

Mason T., Wang L. and Lawrence R. (2005). AUTOJOIN: PROVIDING FREEDOM FROM SPECIFYING JOINS . In Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 5: ICEIS, ISBN 972-8865-19-8, pages 31-38. DOI: 10.5220/0002516100310038


in Bibtex Style

@conference{iceis05,
author={Terrence Mason and Lixin Wang and Ramon Lawrence},
title={AUTOJOIN: PROVIDING FREEDOM FROM SPECIFYING JOINS},
booktitle={Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 5: ICEIS,},
year={2005},
pages={31-38},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002516100310038},
isbn={972-8865-19-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 5: ICEIS,
TI - AUTOJOIN: PROVIDING FREEDOM FROM SPECIFYING JOINS
SN - 972-8865-19-8
AU - Mason T.
AU - Wang L.
AU - Lawrence R.
PY - 2005
SP - 31
EP - 38
DO - 10.5220/0002516100310038