In this paper, we present a fuzzy linguistic scale, which is characterized by triangular fuzzy numbers on [1/9, 9], for the comparison between two alternatives, and introduce a possibility degree formula for comparing...In this paper, we present a fuzzy linguistic scale, which is characterized by triangular fuzzy numbers on [1/9, 9], for the comparison between two alternatives, and introduce a possibility degree formula for comparing triangular fuzzy numbers. We utilize the fuzzy linguistic scale to construct a linguistic preference matrix, and propose a fuzzy induced ordered weighted geometric averaging (FIOWGA) operator to aggregate linguistic preference information. A method based on the fuzzy linguistic scale and FIOWGA operator for decision-making problems is presented. Finally, an illustrative example is given to verify the developed method and to demonstrate its feasibility and effectiveness.展开更多
Finding all occurrences of a twig pattern is a core operation of extensible markup language (XML) query processing. Holistic twig join algorithms, which avoid a large number of intermediate results, represent the stat...Finding all occurrences of a twig pattern is a core operation of extensible markup language (XML) query processing. Holistic twig join algorithms, which avoid a large number of intermediate results, represent the state-of-the-art algorithms. However, ordered XML twig join is mentioned rarely in the literature and previous algorithms developed in attempts to solve the problem of ordered twig pattern (OTP) matching have poor performance. In this paper, we first propose a novel children linked stacks encoding scheme to represent compactly the partial ordered twig join results. Based on this encoding scheme and extended Dewey, we design a novel holistic OTP matching algorithm, called OTJFast, which needs only to access the labels of the leaf query nodes. Furthermore, we propose a new algorithm, named OTJFaster, incorporating three effective optimization rules to avoid unnecessary computations. This works well on available indices (such as B+-tree), skipping useless elements. Thus, not only is disk access reduced greatly, but also many unnecessary computations are avoided. Finally, our extensive experiments over both real and synthetic datasets indicate that our algorithms are superior to previous approaches.展开更多
基金The National Natural Science Foundation of China(79970093) the Ph.D. Dissertation Foundation of Southeast University- NARI-Relays Electric Co. Ltd.
文摘In this paper, we present a fuzzy linguistic scale, which is characterized by triangular fuzzy numbers on [1/9, 9], for the comparison between two alternatives, and introduce a possibility degree formula for comparing triangular fuzzy numbers. We utilize the fuzzy linguistic scale to construct a linguistic preference matrix, and propose a fuzzy induced ordered weighted geometric averaging (FIOWGA) operator to aggregate linguistic preference information. A method based on the fuzzy linguistic scale and FIOWGA operator for decision-making problems is presented. Finally, an illustrative example is given to verify the developed method and to demonstrate its feasibility and effectiveness.
基金Project supported by the National Natural Science Foundation of China (Nos 60603044 and 60803003)the Program for the Changjiang Scholars and Innovative Research Team in University (No IRT0652)the Key Technology Projects of Zhejiang Province, China (No. 2006c11108)
文摘Finding all occurrences of a twig pattern is a core operation of extensible markup language (XML) query processing. Holistic twig join algorithms, which avoid a large number of intermediate results, represent the state-of-the-art algorithms. However, ordered XML twig join is mentioned rarely in the literature and previous algorithms developed in attempts to solve the problem of ordered twig pattern (OTP) matching have poor performance. In this paper, we first propose a novel children linked stacks encoding scheme to represent compactly the partial ordered twig join results. Based on this encoding scheme and extended Dewey, we design a novel holistic OTP matching algorithm, called OTJFast, which needs only to access the labels of the leaf query nodes. Furthermore, we propose a new algorithm, named OTJFaster, incorporating three effective optimization rules to avoid unnecessary computations. This works well on available indices (such as B+-tree), skipping useless elements. Thus, not only is disk access reduced greatly, but also many unnecessary computations are avoided. Finally, our extensive experiments over both real and synthetic datasets indicate that our algorithms are superior to previous approaches.
