Computer Science
2 years ago

New relational model allows users to control duplicate elimination in queries.

An extended relational algebra with control over duplicate elimination
Umeshwar Dayal, Nathan Goodman, Randy H. Katz

Paper Summary

The article introduces a new way to work with data in databases, allowing for duplicate entries to be kept if needed. It presents three methods for writing queries in this new system: extended relational algebra, tableaux, and DAPLEX. The researchers show that solving certain types of queries is still possible, but can be complex. They also find that the extended algebra and DAPLEX are equally powerful for certain types of queries.

Related papers

Theme background image
Computer Science
8 years ago

New framework revolutionizes query evaluation in probabilistic databases, boosting efficiency exponentially!

Trajectory Analysis
Data Stream Management
Semantic Web
2 views
Theme background image
Computer Science
8 years ago

New database languages revolutionize data manipulation with set-valued attributes!

Data Stream Management
Trajectory Analysis
Bayesian Networks
2 views
Theme background image
Computer Science
8 years ago

New relational model allows users to control duplicate elimination in queries!

Data Stream Management
Semantic Web
Trajectory Analysis
1 view