Précis querying over relational data
Précis querying over relational data
diploma thesis (DEFENDED)

View/ Open
Permanent link
http://hdl.handle.net/20.500.11956/9951Identifiers
Study Information System: 44924
CU Caralogue: 990008535360106986
Collections
- Kvalifikační práce [11349]
Author
Advisor
Referee
Kopecký, Michal
Faculty / Institute
Faculty of Mathematics and Physics
Discipline
Software systems
Department
Department of Software Engineering
Date of defense
21. 5. 2007
Publisher
Univerzita Karlova, Matematicko-fyzikální fakultaLanguage
English
Grade
Good
Free form of querying a database belongs among basic methods of text processing. In the past, a number of attempts appeared to use this style of querying also over a relational database (e.g. system BAROQUE [3] in 80ties). Authors of [1] introduce a new technique of a free querying, in which complex queries in SQL over a relational database are automatically generated. As an answer they provide more relations than one as it is usual in relational database languages. User preferences are considered, e.g. according to his/her profile. The goal of thesis is to design and implement a prototype of a system that offers such functionality on the top an existing relational DBMS.