• Journal of Korean Society for Quality Management
• /
• v.45 no.4
• /
• pp.933-942
• /
• 2017

Purpose: The purpose of this paper is to evaluate the performance quality of the open source DBMSs. Performance quality is defined as processing time for Join queries. Query processing time is measured and compared in the most widely used open source DBMSs and commercial DBMS. Methods: By varying the number of tuples of two relations to be joined, the average processing time(seconds) of a Join query in each DBMS was obtained experimentally. ANOVA and Tukey HSD test were used in order to compare the performance quality of DBMSs. Results: There was a significant difference between the performance qualities of the three DBMSs at all experimental levels where the number of tuples was 100, 1,000, 2,000, 10,000, and 50,000. As a result of the Tukey HSD test, two open source DBMSs (MariaDB, MySQL) were classified in the same group only at the tuple level of 100. The commercial DBMS (MS-SQL Server) belonged to another group. At level of more than 1,000 tuples, all three DBMSs belonged to different groups. Conclusion: Within the open source DBMS group, MariaDB showed the better performance quality except for a small number of tuples. Thus the results show that MariaDB can be the alternative to MySQL which is currently most widely used. Between open source DBMS and commercial DBMS groups, MS-SQL Server always shows the best performance quality, but the less number of tuples, the less the difference.

• Journal of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.225-251
• /
• 2018

The m-isometry of a single operator in Agler and Stankus [3] was naturally generalized to the m-isometric tuple of several commuting operators by Gleason and Richter [22]. Some examples of m-isometric tuples including the recently much studied Arveson-Drury d-shift were given in [22]. We provide more examples of m-isometric tuples of operators by using sums of operators or products of operators or functions of operators. A class of m-isometric tuples of unilateral weighted shifts parametrized by polynomials are also constructed. The examples in Gleason and Richter [22] are then obtained by choosing some specific polynomials. This work extends partially results obtained in several recent papers on the m-isometry of a single operator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5888-5903
• /
• 2019

The Relational ranking method applies authority-based ranking in relational dataset that can be modeled as graphs considering also their tuples' values. Authority directions from tuples that contain the given keywords and transfer to their corresponding neighboring nodes in accordance with their values and semantic connections. From our previous work, ObjectRank extends to ValueRank that also takes into account the value of tuples in authority transfer flows. In a maked difference from ObjectRank, which only considers authority flows through relationships, it is only valid in the bibliographic databases e.g. DBLP dataset, ValueRank facilitates the estimation of importance for any databases, e.g. trading databases, etc. A relational keyword search paradigm Object Summary (denote as OS) is proposed recently, given a set of keywords, a group of Object Summaries as its query result. An OS is a multilevel-tree data structure, in which node (namely the tuple with keywords) is OS's root node, and the surrounding nodes are the summary of all data on the graph. But, some of these trees have a very large in total number of tuples, size-l OSs are the OS snippets, have also been investigated using ValueRank.We evaluated the real bibliographical dataset and Microsoft business databases to verify of our proposed approach.

• Journal of Internet Computing and Services
• /
• v.13 no.3
• /
• pp.93-105
• /
• 2012

A data stream is a series of tuples which are generated in real-time, incessant, immense, and volatile manner. As new information technologies are actively emerging, stream processing methods are being needed to efficiently handle data streams. Especially, finding out an efficient evaluation for a multi-way join would make outstanding contributions toward improving the performance of a data stream management system because a join operation is one of the most resource-consuming operators for evaluating queries. In this paper, in order to evaluate efficiently a multi-way join continuous query, we propose a novel method to decrease the cost of a query by eliminating unsuccessful intermediate results. For this, we propose a matrix-based structure for monitoring data streams and estimate the number of final result tuples of the query and find out unsuccessful tuples by matrix multiplication operations. And then using these information, we process efficiently a multi-way join continuous query by filtering out the unsuccessful tuples in advance before actual evaluation of the query.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.653-659
• /
• 2017

Let $p{\geq}1$ be a real number. A tuple $T=(T_1,{\ldots},T_n)$ of commuting bounded linear operators on a Banach space X is called an ${\ell}^p$-spherical isometry if ${\sum_{i=1}^{n}}{\parallel}T_ix{\parallel}^p={\parallel}x{\parallel}^p$ for all $x{\in}X$. The tuple T is called a toral isometry if each Ti is an isometry. By a result of Ansari, Hedayatian, Khani-Robati and Moradi, for every $n{\geq}1$, there is a supercyclic ${\ell}^2$-spherical isometric n-tuple on ${\mathbb{C}}^n$ but there is no supercyclic ${\ell}^2$-spherical isometry on an infinite-dimensional Hilbert space. In this article, we investigate the supercyclicity of ${\ell}^p$-spherical isometries and toral isometries on Banach spaces. Also, we introduce the notion of semicommutative tuples and we show that the Banach spaces ${\ell}^p$ ($1{\leq}p$ < ${\infty}$) support supercyclic ${\ell}^p$-spherical isometric semi-commutative tuples. As a result, all separable infinite-dimensional complex Hilbert spaces support supercyclic spherical isometric semi-commutative tuples.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.1-11
• /
• 2010

Recently, there has been a growing interest in the processing of continuous queries over multiple data streams. When the arrival rates of tuples exceed the memory capacity of the system, a load shedding technique is used to avoid the system becoming overloaded by dropping some subset of input tuples. In this paper, we propose an effective load shedding algorithm for multi-way windowed joins over multiple data streams. Most previous load shedding algorithms estimate the productivity of each tuple, i.e., the number of join output tuples produced by the tuple, based on its "join attribute value" and drop tuples with the lowest productivity. However, the productivity of a tuple cannot be accurately estimated from its join attribute value when the join attribute values are unique and do not repeat, or the distribution of the join attribute values changes over time. For these cases, we estimate the productivity of a tuple based on its "arrival order" on data streams, rather than its join attribute value. The proposed method can effectively estimate the productivity of a tuple even when the productivity of a tuple cannot be accurately estimated from its join attribute value. Through extensive experiments and analysis, we show that our proposed method outperforms the previous methods in terms of effectiveness and efficiency.

• East Asian mathematical journal
• /
• v.7 no.1
• /
• pp.61-70
• /
• 1991

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1205-1211
• /
• 2010

In the present article, we investigate the possibility of a real-valued map on the space of tuples of commuting trace-class self-adjoint operators, which behaves like the usual trace map on the space of trace-class linear operators. It turns out that such maps are related with continuous group homomorphisms from the Milnor's K-group of the real numbers into the additive group of real numbers. Using this connection, it is shown that any such trace map must be trivial, but it is proposed that the target group of a nontrivial trace should be a linearized version of Milnor's K-theory as with the case of universal determinant for commuting tuples of matrices rather than just the field of constants.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.409-420
• /
• 2006

In this paper we consider the set of all n + 1-tuples of real numbers, not necessarily all distinct, in the decreasing order from the unit interval under the usual ordering of real numbers, always including 1. Such n + 1-tuples inherently arise as the membership values of fuzzy subsets and are called keychains. An natural equivalence relation is introduced on this set and the equivalence classes of keychains are studied here. The number of such keychains is finite and the set of all keychains is a lattice under the coordinate-wise ordering. Thus keychains are subchains of a finite chain of real numbers in the unit interval. We study some of their properties and give some applications to counting fuzzy subsets of finite sets.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.197-211
• /
• 2011

Every (1, 1)-knot is represented by a 4-tuple of integers (a, b, c, r), where a > 0, b $\geq$ 0, c $\geq$ 0, d = 2a+b+c, $r\;{\in}\;\mathbb{Z}_d$, and it is well known that all 2-bridge knots and torus knots are (1, 1)-knots. In this paper, we describe some conditions for 4-tuples which determine 2-bridge knots and determine all 4-tuples representing any given 2-bridge knot.