Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Query Language Selection Procedure
Conclusions
References
All Topics
Computer Science
Database Systems

Choosing a database query language

Profile image of Yannis VassiliouYannis Vassiliou

1984

Abstract

CHOOSING A DATABASE QUERY LANGUAGE Matthias Jarke and Yannis Vassiliou November 1982 Revised April 1984 Center for Research on Information Systems Computer Applications and Information Systems Graduate School of Business Administration New York ...

Related papers

Querying Database-Backed Web Sites
Sankar Virdhagriswaran

W3c Workshops, 1998

This paper discusses the use of XML in conjunction with a variety of repositories and database systems, and outlines some of the requirements for an effective query language. Many of the more general issues relating to query languages have been discussed in the references for the workshop, and are not repeated here. This paper therefore concentrates on one aspect of the query problem that seems to require particular attention.

View PDFchevron_right
Flexible Query Languages for Relational Databases: An Overview
Rita A Ribeiro

2020

We present an overview of the most important proposals for human-oriented query languages for relational databases, based on fuzzy sets theory. To highlight important issues concerning communication with databases, we propose two taxonomies: the first taxonomy deals with flexible query languages in crisp relational databases and the second deals with flexible query languages in fuzzy relational databases. They can help database designers and users understand and select the best approaches to solve their problems.

View PDFchevron_right
Improving the Query Mode and its Interface for Relational Database Applications
Ali Matarawy

2000

The paper presents an enhanced generic query mode and its interface for any database application. It is intelligent in the sense that it answers most of the possible queries or questions that may arise in the user's mind without the need or support of the application developer. This is not the case in all previous traditional query modes; all of

View PDFchevron_right
A query language for a Website management system
Mary Fernandez

Sigmod Record, 1997

View PDFchevron_right
D2. 5.2 Report on Query Language Design and Standardisation
Ian Horrocks

Page 1. D2.5.2 Report on Query Language Design and Standardisation Jeff Z. Pan (UoM) Enrico Franconi, Sergio Tessaris (FUB), Birte Glimm (UoM), Wolf Siberski (L3S), Vassilis Tzouvaras, Giorgos Stamou, (ITI) Ian Horrocks, Lei Li (UoM) and Holger Wache (VU) Abstract.

View PDFchevron_right
Generalized Query-By-Rule: a heterogeneous database query language
L M Patnaik

Computer Languages, 1985

Abstrae~This paper describes the design and implementation of a high-level query language called Generalized Query-By-Rule (GQBR) which supports retrieval, insertion, deletion and update operations. This language, based on the formalism of database logic, enables the users to access each database in a distributed heterogeneous environment, without having to learn all the different data manipulation languages. The compiler has been implemented on a DEC 1090 system in Pascal. Query language Heterogeneous distributed databases Database logic cL 1~.,3 ~ A

View PDFchevron_right
Fuzzy querying: Issues and perspectives
Sławomir Zadrożny, Janusz Kacprzyk

2000

View PDFchevron_right
Query Language Construction
Kazimierz Subieta

The book presents the Stack-Based Approach (SBA) which is a formal methodology addressing database query and programming languages. In SBA we reconstruct query languages' concepts from the point of view of programming languages (PL). The approach is motivated by our belief that there is no definite border line between querying and programming; thus there should be a universal theory that uniformly covers both aspects. SBA offers a unified and universal conceptual and semantic basis for queries and programs involving queries, including programming abstractions such as procedures, functions, classes, types, methods and views. SBA assumes a semantic specification method that is referred to as abstract implementation. It is a kind of operational semantics where one has to determine precisely on an abstract level all the data structures that participate in query/program processing, and then, to specify the semantics of all the languages' operators in terms of actions on these structures. SBA introduces three such structures that are well-known in the specification of PLs: (1) an object store, (2) an environment stack, (3) a query result stack (thus the stack-based approach). These structures are fundamental for precise semantic description of everything that may happen in database query/programming languages. In particular, classical query operators, such as selection, projection, joins and quantifiers, can be generally and precisely specified using the above abstract structures, with no references to classical database theories such as relational/object algebras or calculi. SBA introduces a model query and programming language Stack-Based Query Language (SBQL). It plays the same role as the relational algebra for the relational model, but SBQL is incomparably more powerful. The power of SBQL concerns a wide spectrum of data structures that is able to serve and complete algorithmic power of querying and manipulation capabilities. At the same time, SBQL is fully precise with respect to the specification of semantics. SBQL has been carefully designed from the pragmatic (practical) point of view. We were struggling severely with parasite syntactic sugar, redundant operators and semantic reefs (when human intuitive semantics does not match machine semantics). The pragmatic quality of SBQL is achieved by orthogonality of introduced data/object constructors, orthogonality of all the language constructs, object relativism, orthogonal persistence, typing safety, introducing all the classical and some new programming abstractions and following commonly accepted programming languages' principles. SBA and SBQL are neutral to database models. SBA covers all the database models that we are aware of, starting from the relational model, through XML-oriented data model, RDF-oriented data model, up to sophisticated object-oriented models with static and dynamic inheritance, collections, associations, polymorphism, etc. Our fundamental assumption is that SBA and SBQL address data structures rather than data models. Once we determine how particular concepts in a data model are to be mapped as abstract data structures, we can propose a corresponding SBQL variant that will be able to handle these structures with full algorithmic universality and precision. In this way we have shifted the discussion of query language to another level: we can talk about how particular features of data structures are to be served by SBQL rather than sticking to a concrete query language with a concrete data model. For instance, when we determine how XML files are to be mapped as abstract data structures, we can propose an SBQL variant to address them. In this way, we achieve a unique universality, flexibility and performance optimization potential. In particular, SBQL is the first and only query language that deals with dynamic object roles and dynamic inheritance. Moreover, powerful query optimization methods that are developed for SBQL are prepared to work with such advanced features. This book is a specification of the SBA theory and the SBQL language. It contains general observations on syntax, semantics and pragmatics of query and programming languages for objectoriented database models. General assumptions for the SBQL semantics are also presented. Then, the book deals with abstract object store models as main components of the concept of state, in particular: AS0 store model (complex objects and pointer links), AS1 store model (classes, methods and inheritance), AS2 store model (dynamic object roles and dynamic inheritance) and AS3 store model (encapsulation and information hiding). In the following the environment stack (ENVS), query results and query result stack (QRES) and the function nested are introduced. These concepts form the formal basis for SBQL semantics which is defined in the operational style through abstract implementation. The core of the semantics are so-called non-algebraic operators (selection, projection, navigation, join, quantifiers, etc.), which remain algebraic operators from the relational algebra, but their general

View PDFchevron_right
A Query Language and Processor for a WebSite Management System
Mary Fernandez

Sigmod Record, 1997

View PDFchevron_right
Query-by-Example: A data base language
Moshé Zloof

IBM Systems Journal, 2000

Discussed is a high-level data base management language that provides the user with a convenient and unijied interface to query, update, dejine, and control a data base. W h e n the user performs an operation against the data base, he jills in an example of a solution to that operation in skeleton tables that can be associated with actual tables in the data base. The system is currently being used experimentally for various applications. Query-by-Example: a data base language by M. M. Zloof Query-by-E~ample"~ is a high-level data base management language that provides a convenient and unified style to query, update, define, and control a relational data base. The philosophy of Query-by-Example is to require the user to know very little in order to get started and to minimize the number of concepts that he subsequently has to learn in order to understand and use the whole language. The language syntax is simple, yet it covers a wide variety of complex transactions. This is achieved through the use of the same operations for retrieval, manipulation, definition, and control (to the extent possible). The language operations should mimic, as much as possible, manual table manipulation, thus capturing the simplicity, symmetry and neutrality of the relational The formulation of a transaction should capture the user's thought process, thereby providing freedom to formulate a transaction. The system should allow the user to create and drop tables dynamically from the data base; it must also provide the user with a dynamic capability for defining control statements and security features. The architecture of the Query-by-Example language addresses all the requirements just mentioned. The results of various psychological studies of the language7 show that it requires less than three hours of instruction for nonprogrammers to acquire the skill to make fairly complicated queries. Such queries would otherwise require the user to know first order predicate calculus. Other nonprocedural languages that deal with the same topic are SEQUEL^ and QUEL.' 324 ZLOOF IBM SYST J ZLOOF IBM SYST J

View PDFchevron_right

References (76)

  1. Artificial Intelligence Corp. , lf Intellect Query Systemff, Reference Manual, (1982).
  2. Astrahan et al., ltSYSTEM-R: Relational Approach to Database Managementff, ACM Transactions on Database Systems, Vol. 1,2, June, (1976).
  3. Bates, M., Bobrow,R.J., IfA Transportable Natural Language Interface for Information Retrievalff, in Proceedings 6th ACM-SIGIR Conference, June 1983. [BCS 811
  4. British Computer Society, IfQUERY LANGUAGES -A Unified Approach", Report of the British Computer Society Query Languages Group, Heyden Publ, Samet (ed.), (1981).
  5. Boyce et al, "Specifying Queries as Relational Expressions: The SQUARE Data Sublanguageft, Communications of the ACM, 18, (1975).
  6. Brosey, M., Shneiderman, B., ltTwo Experimental Comparisons of Relation1 and Hierarchical Database Modelsft, International Journal for Man-Machine Studies, Vol. 10, (1978). [BROWN 81 I Brown, R.M., Cattell, R.G.G., Suzuki, N., IfThe Cedar DBMS: A Preliminary Reportw, in Proceedings ACM-SIGMOD Conference, Ann Arbor 198 1 , 205-2 1 1 . [CARBO 79 I Carbonell, J., Subjective Understanding: Computer Models of Belief Systems, Unpublished Ph.D. Dissertation, Yale University 1979- [ChFu 79 1
  7. Chang, N.S., Fu, K.S., "Query-by-Pictorial ExampleH, Proc. IEEE Computer Society Third Intl . COMPSAC '79, ( 1979). [CINCO 781 CINCOM Systems, Inc., "Total Information System, The Next Generation of Softwaren, (1978).
  8. CODAS 7 1 I ffCodasyl Data Base Task Group Reportw, in Cont. Data System Languages, (ACM), New York, (1971). Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39 [CODD 70 1
  9. Codd, E.F., "A Relational Model of Data for Large Shared DatabanksN Communications, ACM 13,6, (1970). [CODD 71 I Codd, E.F., Data Base Sublanguage Founded on the Relational Calculusw, Proceedings of ACM SIGFIDET Workshop on Data Description, Access and Control, San Diego, Codd and ~e a n (Ed.), ( 1979).
  10. Codd, E.F., "Seven Steps to Rendezvous with the Casual UserN, Data Base Management, Klimbie and Koffeman (Eds), North-Holland, (1974) , 179-199 [CODD 781
  11. Codd E .F . , "How About ~eciently?" , Databases : Improving Usability and Responsiveness, Shneiderman (Ed.), Academic Press, 1978 [CUFF 801 Cuff,R.N., "On Casual UsersH, Int. Journal Man-Machine Communications, 12, (1980), 163-187. [DAMER 79 I Damerau, F.J., "The Transformational Question Answering (TQA) System Operating Statistics", IBM Research Report, RC 7739, (1979).
  12. Ellls,C.A., and Nutt,G.J., "Office Information Systems and Computer Sciencew, ACM Computing Surveys, 12, (1980).
  13. D.W.Embley, G.Nagy, "Behavioural Aspects of Text Editorst1, ACM Computing Surveys 13 (1981), 33-70 [ EnGr 75 1
  14. Engel,E., and Granda, R.E., "Guidelines for manldisplay interfacesw, IBM Poughkeepsie Lab., Tech. report, TR 0002720, N.Y., December, (1975).
  15. Fields, C., Negroponte, N., "Using New Clues to Find DataH, Proceedings of the International Converence on Very Large Data Bases (VLDB), (1976).
  16. Foley,J.D., Van Dam,A., "Fundamentals of Interactive Computer Graphicsm, Addison-Wesley, (1982).
  17. A.Gable, C.V.Page, "The Use of Artificial Intelligence Techniques in Computer-Assisted Instructionfi, International Journal of Man-Machine Studies 12 ( 1980 ) , 259-282. Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39 [GoAs 75 1
  18. Gould, J.D., Ascher, R., !$Use of an IQF-like query language by non-programmersff, IBM Thomas J. Watson Research Center Technical Report RC5279, Yorktown Heights 1975.
  19. Goldberg, A,, Robson, Special Issue on Smalltalk, BYTE Magazine, August 1981.
  20. Greenblatt, D. and Waxman,J., "A Study of Three Database Query Languagesff, Databases: Improving Usability and Responsiveness, B, Shneiderman (ed), Academic Press, New York, (1978), 77-97. [HARRI 77 1
  21. Harris, L.R., "User Oriented Database Query with the ROBOT natural Language Query Systemw, International Journal of Man-Machine Studies, 9, (1979)- [HENDR 781 Hendrix, G.G, E.D. Sacerdoti, D.Sagalowicz, J. Slocum , "Developing a Natural Language Interface to Complex Datau, ACM Transactions on Database Systems, vo1.3, (1978), 105-147. [ HEROT 8 I I Herot, C.F., flSpatial Management of Dataf1, ACM Transactions on Database Systems, 5, ( 1981 ) , 493-51 3. [HEROT 82 I Herot, C.F., ffGraphical User Interfaces", in Proceedings of NYU Symposium on User Interfaces, New York, May, (1982).
  22. Hoeppner, W., Christaller, T., Marburger, H., Morik, K., Nebel, B,, OILeary, M., Wahlster, W., ffBeyond Domain-Independence: Experience with the Development of a German Language Access System to Highly Diverse Background Systemsff, in Proceedings Eighth International Joint Conference on Artificial Intelligence, Kar lsruhe 1983, 588-594.
  23. HUMAN 821 Human Factors in Computer Systems, Gaithersburg, MD, (1982). [IBM 751 "IBM Information Management System/Virtual Storage (IMS/VS), General Information Manualf1, G 20-1260-3, IBM Corp, , ( 1975).
  24. M. Jarke, J.A. Turner, E.A. Stohr, Y. Vassiliou, N.H. White, K, Michielsen, "A Field Evaluation of Natural Language for Data Retrieval", IEEE Transactions on Software Engineering, forthcoming 1984, Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39 [Java 841
  25. M, Jarke, Y. Vassiliou, "Coupling Expert Systems and Database Management Systemsw, in Artificial Intelligence Applications for Business, W. Reitman (ed.), Ablex, Norwood, NJ, (1984), 65-85. [KRAUS 79 I J. Krause, "Preliminary Results of a User Study with the 'User Specialty Languages1 System, and Consequences for the Architecture of Natural Language Interfaces1', IBM Heidelberg Scientific Center TR 79.04.003, (1979)
  26. Krause, J., @#Natural Language Access to Information Systems: An Evaluation Study of its Acceptance by End Usersf1, Information Systems 4 (19801, 297-318.
  27. KRAUS 82 1
  28. Krause, J., Mensch-Maschine-Kommunikation in natuerlicher Sprache, Niemeyer, Tuebingen 1982.
  29. Lacroix, M., Pirotte, A., "ILL: An English Structured Query Language for Relational Databasesw, Architecure and Models in DBMS", Njissen (Ed.), North-Holland, (1975).
  30. Lacroix, M., Pirotte, A,, "Example Queries in Relational Languagestt, Unpublished Technical Note, (1976).
  31. Lacroix, M., Pirotte, A., "Domain-Oriented Relational Languagesff, Prdc. Intl. Conf. Very Large Data Bases, (1977), 370-378. [Lapi 801
  32. Lacroix, M., Pirotte, A,, ftUser Interfaces for Database Application Programmingw, MBLE Research Laboratory, Brussels, (1980)
  33. Lebowitz, M., Generalization and Memory in an Integrated Understanding System, unpublished Ph.D. Dissertation, Yale University 1980.
  34. H.Lehmann, A.Blaser, "Query Languages in Data Base Systems", IBM Heidleberg Scientific Center TR 79.07.004, (1979) [ L E M 771 Lehmann et al, llLanguage Facilities of USL German, Version III", IBM Heidelberg Scientific Center, TN. 77.04, ( 1977). Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39 [LEHMA 781
  35. H.Lehmann, N.Ott, M.Zoeppritz, "User Experiments with Natural Language for Data Base Accessw, Proc. 7th Int. Conf. on Computational Linguistics, Bergen, (1978).
  36. Leavenworth, B.M., Sammet, J., "An Overview of Non-Procedural Languagesw, Sigplan Notices. 9, (1974).
  37. Lochovsky, F.H., "Data Base Management System User Performance Variablesw, Ph.D. Thesis, University of Toronto, (1976).
  38. Lochovsky, F.H., Tsichritzis, D.C., "User Performance Consideration in DBMS SelectionH, in Proceedings of ACM SIGMOD, (1977)p p-128-134.
  39. Lochovsky F.H., Tsichritzis, D.C., "Interactive Query Languages for External Databasestt, CSRG Technical Memo, University of Toronto, (1981).
  40. Lochovsky F.H., Tsichritzis, D.C., "Querying External Databasesff, Human Factors and Interactive Computer Systems, Y.Vassiliou (ed. ), Ablex, Norwood, NJ, 1984. [MALON 82 I Malone,T., "Heuristics for Designing Enjoyable User Interfaces: Lessons from Computer Gamesw, Proceedings, Human Factors in Computer Systems, Gaithensburg, (1982), 63-68, [McDON 751
  41. McDonald, N.H., "CUPID: A Graphic Oriented Facility for Support of Non-Programmer Interact ions with a Database, Memo Em-M563, Ph.d. Thesis, University of California, Berkeley, (1975).
  42. McDonald, N.H. , J.P. McNally, Video Graphic Query Facility Database Designw, in Proceedings of the ACM SIGMODlSIGSMALL Workshop on Databases for Small Systems, Orlando, Florida, October (1981).
  43. I McDonald, N.H., McNally, L.P., "Query Language Feature Analysis by UsabilityH, unpublished paper, University of South Florida, ( 1982).
  44. Moorhead, W.G., lfGXRAM-A Relational Data Base Interface for Graphicsff, Tech. Rep. RJ1735, IBM Research Lab, San Jose, ( 1976). Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39
  45. T.P.Moran, **Guest Editor's Introduction: An Applied Psychology of the User1*, ACM Computing Surveys 13 (1981), 1-12 [NeSp 791
  46. Newman, W.S., Sproull, R.F., **Principles of Interactive Computer Graphicst1, McGraw-Hill, New York, (1979).
  47. Plath, W.J., llREQUEST: A Natural Language Question Answering System1*, IBM J. Res. Development, vol. 20, ( 1976).
  48. Reisner, P., $*Human Factors Evaluation of Two Data Base Query Languages: SQUARE and SEQUEL1*, Proceedings of NCC, Vol. 44, ( 1975). EREISN 771
  49. Reisner, P., "Use of Psychological Experimentation as an aid to Development of Query Languaget1, IEEE Transactions of Software Engineering , SE-3, 3, ( 1977) , 2 18-229 [REISN 8 1 I P.Reisner, "Human Factors Studies of Database Query Languages: A Survey and Assessment", ACM Computing Surveys 13 (1981), 13-32 [RTG 821 llFinal Report of the ANSI/X3/SPARC DBS-SG Relational Database Task GroupH, M.Brodie and J.W.Schmidt (eds), SIGMOD Record 12, 4, ( 1982).
  50. Schank, R.C., Slade, S,, ttAdvisory Systemst1, in Artificial Intelligence Applications for Business, W.Reitman (ed.), Ablex, Norwood, NJ, 1984, 249-265.
  51. Schmandt,C., Hulteen,E.A., **The Intelligent Voice-Interactive Interfacet*, Proceedings of Human factors in Computer Systems, Gaithersburg, Md, (1982).
  52. Schmidt, J.W., **Some High-level Language Constructs for Data of Type Relation1*, Transacions on Database Systems, 2, (1977), pp. 247-26 1 .
  53. Schneider, M., tlErgonomic Considerations in the Design of Control Languages1*, Human Factors and Interactive Computer Systems, Y .Vassiliou (ed. ) , Ablex , Norwood, NJ, 1984. [SENKO 781
  54. Senko, M.E., llDIAM I1 with FORAL LP: Making Pointed Queries with Light Pen1*, Information Processing 77, North-Holland, (1977). Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39 [SHIPM 811
  55. Shipman, "The Functional Data Model and the Data language DAPLEXlg, ACM Transactions on Database Systems, 6,1, (1981). [SHNEI 781
  56. Shneiderman, B., "Improving the Human Factor Aspect of Database Interactionsft, ACM Transactions on Database Systems, 3, ( 1978).
  57. Shneiderman, B,, Software Psychology, Cambridge/Mass., (1980). [SHNEI 841
  58. Shneiderman, B., "The Future of Interactive Systems and the Emergence of Direct Manipulationtg, Human Factors and Interactive Computer Systems, Y .Vassiliou (ed. ) , Ablex , Norwood, NJ , 1984. [SmWe 831
  59. Small, D.W., Weldon, L.J. "An Experimental Comparison of Natural and Structured Query Languages", Human Factors 25, 3 ( 1983 ) , 253-263.
  60. Smith J.M, Fox S., Landers T., "Reference Manual for ADAPLEX", Tech. Report CCA-8 1-02, January ( 198 1 ) .
  61. E,A.Stohr, J.A.Turner, Y.Vassiliou, N.H.White, "Research in Natural Language Retrieval Systemst', 15th Ann.Hawaii 1nt.Conf. on System Sciences, Hawaii 1982 [STONE 751
  62. Stonebraker, M.R., et al, "The Design and Implementation of INGRESfl, ACM Transaction on Database Systems, vol. 1 , no. 3, September, ( 1976 ) . ES~RO 771
  63. Stonebraker, M.R., Rowe, L.A., tgObservations on Data Manipulation Languages and Their Embedding in General Purpose Programming Languages", Proc. ACM Intl. Conf. Very Large Data Bases, (19771, 128-1430 [T~GO 751
  64. Thomas, J.C. and Gould, J.D., "A Psychological Study of Query by ExampleN, Proceedings of NCC, Vol. 44, (1975).
  65. I Thomas, J.C., "Quantifiers and Question-Askingg1, IBM Research Report, RC 5866, T, J .Watson Research Laboratory, Yorktown Heights, N.Y., (1976).
  66. Thompson, C.W., Ross, K.M., Tennant, H.R., Saenz, R.M., "Building Usable Menu-Based Natural Language Interfaces to Databasesfg, in Proceedings 9th VLDB Conference, Florence 1983, 43-55. Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39 [TODD 761
  67. Todd, S.J.P., "The Peterlee Relational Test Vehicle -A System Overview", IBM Systems Journal, 15, (1976).
  68. Tsichritzis, D.C., "LSL: A Link and Selector LanguageH, Proceedings of the ACM SIGMOD, Washington, (1976).
  69. I Turner,J., Jarke,M., Stohr,T, Vassiliou,Y., and White,N., "Using Restricted Natural Language for Data Retrieval -A Plan for Field Evaluationw, Human Factors and Interactive Computer Systems, Y,Vassiliou (ed.), Ablex, Norwood, NJ, 1984. [VASSI 831
  70. Vassiliou, Y., Jarke, M., Stohr, E.A., Turner, J.A., White, N.H., "Natural Language for Database Queries: A Laboratory StudyH, MIS Quarterly 7, 4 (1983), 47-61.
  71. Vassiliou Y., Jarke M., "Query Languages -a TaxonomyH, Human Factors and Interactive Computer Systems, Y .Vassiliou (ed. ) , Ablex, Norwood, NJ, 1984, [WALTZ 781
  72. Waltz,D.L,, "An English Language Question Answering System for a Large Relational Databasew, Communications of the ACM, 21, ( 1978).
  73. Welty, C., "A Comparison of a Procedural and a Non-Procedural Query Language: Syntactic Metrics and Human Factorsn, Ph.D. Dissertation, Univ. Of Mass at Amherst, (1979).
  74. Welty, C., Stemple, D.W., "Human Factors Comparison of a Procedural and a Non-Procedural Query Languagetf, ACM Trasactions on Database Systems, (1981).
  75. Woods, W.A., "Lunar Rocks in Natural English: Explorations in Natural Language Question Answering", Linguistic Structures Processing, Zampolli (ed.), North-Holland, (1977). [WOODS 721 Woods, W.A., Kaplan, R.M., and Nash-Webber, B., "The Lunar Sciences Natural Language Informaion SystemH, Bolt Beranek and Newman, Cambridge, Mass, June, (1972).
  76. Yormark, B., "The ANSI/X3/SPARC/SGDBMS Architectureu, The Ansi/Sparc DBMS Model, Jardine, (ed.), North-Holland, Amsterdam, (1977)t 521. Center for Digital Economy Research Stem School of Business IVorking Paper IS-84-39

Related papers

A framework for choosing a database query language
Yannis Vassiliou

ACM Computing Surveys, 1985

This paper presents a systematic approach to matching categories of query language interfaces with the requirements of certain user types. The method is based on a trend model of query language development on the dimensions of functional capabilities and usability. From the trend model the following are derived: a classification scheme for query languages, a criterion hierarchy for query language evaluation, a comprehensive classification scheme of query language users and their requirements, and preliminary recommendations for allocating language classes to user types.

View PDFchevron_right
Query Languages - a Taxonomy
Yannis Vassiliou

Social Science Research Network, 1982

A taxonomy of database query languages i s presented based on a n a n a l y s i s of e x i s t i n g languages and c u r r e n t t r e n d s i n r e s e a r c h and p r a c t i c e . The c a t e g o r i z a t i o n of query languages i s h i e r a r c h i c a l . A t t h e senses l e v e l , languages a r e d i s t i n g u i s h e d according t o t h e c l u e s and senses employed by t h e user. A t a more d e t a i l e d l e v e l , t h e methods l e v e l , languages a r e c a t e g o r i z e d according t o t h e b a s i c concepts, methodologies and conceptual u s e r models which a r e employed. In a d d i t i o n t o t h i s c a t e g o r i z a t i o n , t h e taxonomy i n c l u d e s schemata of evaluation c r i t e r i a t o be used i n language comparisons.

View PDFchevron_right
Query: The Language of Databases
Ed Hammond

Query languages have become increasingly important as comprehensive medical databases have become a part of the available knowledge base for patient care. As the user community expands and the need for bedside query arises, the requirement for a fast, easy-to-use, interactive query system must be met. This paper describes the evolution of a query language for the TMR database, discusses problems and limitations of the system, and proposes new approaches to the problem.

View PDFchevron_right
A Research Paper ADVANCED QUERY LANGUAGES, INTELLIGENT QUERY PROCESSING NAME: Uzoaru Godson Chetachi In Advanced Databased Management System) Department: Computer Science
UZOARU GODSON

UZOARU GODSON CHETACHI, 2021

Queries can accomplish or discharge many different functions in a database. But their most common task is to retrieve specific data from the tables. The data you want to view is usually spread across several tables in the Database, making use of queries will allow you to view it in a single datasheet. Also, when you don't want to see all the records at once, queries let you add criteria to "filter" the data down to the records you want. This Seminar Paper explains Advanced Query Languages and how intelligent query processing is done. Keywords: Advanced Query, Intelligent Query, Processing, Languages

View PDFchevron_right
No IFs, ANDs, or ORs: A Study of Database Querying
Louis M Gomez

The difficulty of expressing database queries was examined as a function of the language used. Two distinctly different query methods were investigated. One used a standard database query language , SQL, requiring users to express an English query using a formal syntax and appropriate combinations of boolean operators. The second used a newly designed Truth-table Exemplar-Based Interface (TEBI), which only required subjects to be able to choose examplars from a system-generated table representing a sample database. Through users' choices of critical exemplars, the system could distinguish between interpretations of an otherwise ambiguous English query. Performance was measured by number correct, time to complete queries, and confidence in query correctness. Individual difference analyses were done to examine the relationship between subjects' characteristics and ability to express database queries. Subjects' performance was observed to be both better, and more resistant to variability in age and levels of cognitive skills, when using TEBI than when using SQL to specify queries. Possible reasons for these differences are discussed.

View PDFchevron_right

Related topics

  • Computer Science
  • Language Evaluation
  • Query Optimization
  • Social Science Research Network
  • Query Expansion
  • Query Languages
  • Structured Query Language
  • Query by Example
  • web search query
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved