Duplicate detection and deletion in the extended NF2 data model

Küspert, Klaus; Saake, Gunter; Wegner, Lutz

doi:10.1007/3-540-51295-0_120

Cited by 8 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Neither alternative seems very promising for large inputs. Sort semantics and appropriate sort algorithms including duplicate removal and grouping have been considered by Saake et al [Kuespert, Saake, and Wegner 1989;]. Other researchers have focused on storage and retrieval methods for nested relations and operations possible with single scans [Dadam et al 1986;Deppisch, Paul, and Schek 1986;Deshpande and van Gucht 1988;Hafez and Ozsoyoglu 1988;Ozsoyoglu and Wang 1992;Scholl, Paul, and Schek 1987;Scholl 1988] …”

Section: Nested Relationsmentioning

confidence: 99%

Query evaluation techniques for large databases

1993

View full text Add to dashboard Cite

Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On the contrary, modern data models exacerbate it: In order to manipulate large sets of complex objects as efficiently as today's database systems manipulate simple records, query processing algorithms and software will become more complex, and a solid understanding of algorithm and architectural issues is essential for the designer of database management software.This survey provides a foundation for the design and implementation of query execution facilities in new database management systems. It describes a wide array of practical query evaluation techniques for both relational and post-relational database systems, including iterative execution of complex query evaluation plans, the duality of sort-and hash-based set matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.

show abstract

Section: Nested Relationsmentioning

confidence: 99%

Query evaluation techniques for large databases

1993

View full text Add to dashboard Cite

show abstract

“…However, we are Natural JoinSemi join only interested in the fact that an ordering exists and therefore we will just show one such ordering which seems to be appropriate for a tuple-object environment [19]. It is a recursive transitive ordering based on cardinality of sets and lexicographical ordering.…”

Section: Ordering Relationmentioning

confidence: 99%

Joining distributed complex objects: Definition and performance

Teeuw

Blanken

1992

Data & Knowledge Engineering

View full text Add to dashboard Cite

The performance of a non-standard distributed database system is strongly influenced by complex objects. The effective exploitation of parallelism in querying them and a suitable structure to store them are required in order to obtain acceptable response times in these database environments where performance tends to be critical. In this paper we use an hierarchical complex object model with object references and define several join operations for these complex objects which we will call tuple-objects. These join queries for tupleobjects can be categorized into materialized, functional and value-based joins. An analytical performance evaluation gives insight into which distributed storage structures for tuple-objects are most effective with regard to executing the different kinds of tuple-object joins.

show abstract

“…Research on this project originated with the task of devising sorting and duplicate elimination strategies for AIM-P [13]. AIM-P is mostly written in PASCAL and runs on an IBM mainframe.…”

Section: Project History and Design Goals Of Eschermentioning

confidence: 99%

Design issues and first experiences with a visual database editor for the extended NF/sup 2/-data model

Küspert

Teuhola²,

Wegner³

Twenty-Third Annual Hawaii International Conference on System Sciences

Self Cite

View full text Add to dashboard Cite

The extended &-(e&-) data model permits structured data values like (sub-)relations, lists and tuples to be included as attributes in relations. While it is a very powerful data model, it is not easy to handle and even harder to implement. In this paper we describe a visual database editor for the e&-data model for simple tasks like browsing the database, data envy and editing. We believe its interface, based on the paradigm of a two-dimensional cursor, called a finger, is intuitive enough to be used even by casual users. At the same time, the system, named ESCHER, serves as a research vehicle for self-referencing methods in the implementation of database systems. One aspect. a fixpoint "scheme-of-schemes" is discussed in detail and its visual representation, as produced by the running prototype, is shown. Other topics which are treated include the semantics of the cursor movement and new additions to the e& data model, like scripts and links. Finally, we report on first encouraging experiences with ESCHER which also point out where more work needs to be done.

show abstract

Duplicate detection and deletion in the extended NF2 data model

Cited by 8 publications

References 23 publications

Query evaluation techniques for large databases

Query evaluation techniques for large databases

Joining distributed complex objects: Definition and performance

Design issues and first experiences with a visual database editor for the extended NF/sup 2/-data model

Contact Info

Product

Resources

About