Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/4256
Title: Data retrieval and aggregates in SQL*/NR
Authors: Qaraeen, Nael
Ng, Yiu-Kai
Keywords: Recursion theory;Relational databases;Database design;Logic programming
Issue Date: 1995
Abstract: Standard SQL is incapable of handling recursive database queries and nested relations. A proposed solution to allow recursion in SQL was given in SQL [KC93], while a solution to allow nested relations in SQL was given in SQL=N F [RKB87]. However, these two problems with SQL were handled separately, and an extended SQL that handles both recursive queries and nested relations is still lacking. To overcome this shortcoming, we propose an extended SQL, called SQL =NR, that not only can handle both recursive queries and nested relations, but also allows aggregate operators. A query Q in SQL =NR is processed by rst transforming Q into rule expressions in LDL=NR, a logic database language for nested relations, and the transformed rule expressions are evaluated for retrieving the desired result of Q. Transforming Q into rule expressions in LDL=NR is desirable since LDL=NR handles recursion on nested relations with a built-in mechanism for recursive query processing. In this paper, we de ne SQL =NR and include an approach for transforming SQL =NR queries into rule expressions in LDL=NR. SQL =NR, as de ned, enhances the expressive power of standard SQL and SQL=N F and has the expressive advantage over SQL .K
URI: http://hdl.handle.net/20.500.11889/4256
Appears in Collections:Fulltext Publications

Files in This Item:
File Description SizeFormat
10.1.1.52.7689.pdf287.57 kBAdobe PDFView/Open
Show full item record

Page view(s)

142
Last Week
0
Last month
3
checked on Apr 14, 2024

Download(s)

27
checked on Apr 14, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.