Cube algebra on multidimentional database.
نویسندگان
چکیده
منابع مشابه
A Data Cube Algebra Engine for Data
M.L. Kersten, A.P.J.M. Siebes CWI, Amsterdam, The Netherlands M. Holsheimer , F. Kwakkel Data Distilleries, Amsterdam, The Netherlands Abstract On line data mining products, such as Data Surveyor, illustrate that an extensible architecture to accommodate a variety of mining algorithms and database interconnectivity is technically feasible. In this paper we describe the interaction between Data ...
متن کاملConstrained Cube Lattices for Multidimensional Database Mining
In multidimensional database mining, constrained multidimensional patterns differ from the well-known frequent patterns from both conceptual and log ical points of view because of a common structure and the ability to support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attribute values and, even adapted, are not suitable when addre...
متن کاملAn algebra of database preferences
Preferences allow more flexible and personalised queries in database systems. Evaluation of such a query means to select the maximal elements from the respective database w.r.t. to the preference, which is a partial strict-order. We present a point-free calculus of such preferences and exemplify its use in proving algebraic laws about preferences that can be used in query optimisation. We show ...
متن کاملBoolean Gröbner Basis Reductions on Datapath Circuits Using the Unate Cube Set Algebra
Recent developments in formal datapath verification make efficient use of symbolic computer algebra algorithms for formal verification. The circuit is modeled as a set of polynomials over Boolean (or pseudo-Boolean) rings, and Gröbner basis (GB) reductions are performed over these polynomials to derive a canonical representation. GB reductions of Boolean polynomials tend to cause intermediate e...
متن کاملA Fault-tolerant Multicast Routing Algorithm Based on Cube Algebra for Hypercube Networks
In this study a multicast routing algorithm has been developed for faulty hypercube parallel processing system using cube algebra. Without any restriction to the number of the faulty nodes, the routing from the source node to the destination node is implemented minimally. The developed routing algorithm has been visually simulated via prepared data routing simulator program. It has been observe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/18/2/1601