Font Size: a A A

Raw relation sets, order fusion and top-N query problem

Posted on:2003-02-06Degree:Ph.DType:Dissertation
University:State University of New York at BinghamtonCandidate:Chen, YuxiFull Text:PDF
GTID:1468390011479382Subject:Computer Science
Abstract/Summary:
We study Order Fusion in this dissertation based on Raw Relation Sets—Raw Sets for short, which serves as a mathematical model for the data description and combination relevant to both numeric and nonnumeric objects. Since all the objects retain unprocessed, natural, and raw state, a raw set expresses the original data in a way with little information loss. In terms of three kinds of natural relationships, objects are defined according to their behaviors including both qualitative and quantitative features. In addition, precise, imprecise, certain, and uncertain information are all covered and treated in an equal way. They are all valuable and none of them can afford to be disregarded at any time during the data processing. Different from the traditional operations on sets, the raw set operation—raw operation for short, itself is a raw set. Hence, the close-form evaluation has been achieved. The classical operations of sets are the simplest raw operations. As the core, an axiomatic system on Raw Sets is explored in order to provide a solid foundation for the Order Fusion.; As an application, top-N Query Problem is also addressed to illustrate how Raw Sets works in the field of DBMS.
Keywords/Search Tags:Raw, Sets, Order fusion
Related items