Précis querying over relational data
Précis querying over relational data
diplomová práce (OBHÁJENO)
Zobrazit/ otevřít
Trvalý odkaz
http://hdl.handle.net/20.500.11956/9951Identifikátory
SIS: 44924
Kolekce
- Kvalifikační práce [11199]
Autor
Vedoucí práce
Oponent práce
Kopecký, Michal
Fakulta / součást
Matematicko-fyzikální fakulta
Obor
Softwarové systémy
Katedra / ústav / klinika
Katedra softwarového inženýrství
Datum obhajoby
21. 5. 2007
Nakladatel
Univerzita Karlova, Matematicko-fyzikální fakultaJazyk
Angličtina
Známka
Dobře
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.