pith. sign in

arxiv: cs/0406029 · v1 · submitted 2004-06-17 · 💻 cs.DB

Subset Queries in Relational Databases

classification 💻 cs.DB
keywords subsetqueriesrelationalalgebraapplicabilityapplicationsconstructsdatabase
0
0 comments X
read the original abstract

In this paper, we motivated the need for relational database systems to support subset query processing. We defined new operators in relational algebra, and new constructs in SQL for expressing subset queries. We also illustrated the applicability of subset queries through different examples expressed using extended SQL statements and relational algebra expressions. Our aim is to show the utility of subset queries for next generation applications.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.