Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Scott F. Walecka

dblp:32/2168 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Database theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Database theory › dependency theory
axiomatization
0.011982
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies · J. ACM 1982
Database theory
dependency theory
0.011982
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies · J. ACM 1982
Database theory › dependency theory
embedded multivalued dependencies
0.011982
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies · J. ACM 1982

Methods — techniques the papers use, named apart from their topics

implication testing · 0.0
YearPublicationVenuePosition
1982 Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
abstract
It tS shown that embedded multwalued dependencies do not have a complete axlomatizatlon A new type of dependenoes, called subset dependencies, is introduced.Subset dependencies are a generahzauon of embedded multtvalued dependencies It is shown that a subclass of subset dependenoes (that does not include all the embedded multwalued dependenoes) has a complete axlomatlzation consisting of reflexivity and translt~vity rules As a result, ~t ~s shown how to test implications of embedded muluvalued dependencies under some restricted conditions Categories and Subject Descriptors H 2 1 ]Database Management] Logical Destgn--data models
Yehoshua Sagiv, Scott F. Walecka
J. ACM2