The Experts below are selected from a list of 7083 Experts worldwide ranked by ideXlab platform
Yoshiharu Ishikawa - One of the best experts on this subject based on the ideXlab platform.
-
design and evaluation of signature file organization incorporating vertical and Horizontal Decomposition schemes
Database and Expert Systems Applications, 1996Co-Authors: Hiroyuki Kitagawa, Noriyasu Watanabe, Yoshiharu IshikawaAbstract:Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and Horizontal Decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.
-
DEXA - Design and Evaluation of Signature File Organization Incorporating Vertical and Horizontal Decomposition Schemes
Lecture Notes in Computer Science, 1996Co-Authors: Hiroyuki Kitagawa, Noriyasu Watanabe, Yoshiharu IshikawaAbstract:Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and Horizontal Decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.
D J Shyy - One of the best experts on this subject based on the ideXlab platform.
-
tradeoff of Horizontal Decomposition versus vertical stacking in rearrangeable nonblocking networks
IEEE Transactions on Communications, 1991Co-Authors: Chintau Lea, D J ShyyAbstract:A class of rearrangeable nonblocking networks is presented. The proposed networks are fault-tolerant, self-routing, and intended for a very-high-speed environment. Self-routing networks have one major problem when applied to switching: they are blocking networks. To solve this problem, two methods have been used to create self-routing rearrangeable nonblocking networks: Horizontal cascading (HC) and vertical stacking (VS). The authors unify the two approaches and propose a novel class of switching networks. The proposed design principle allows the best tradeoffs among design parameters such as fault tolerance, hardware cost, and the frequency of rearrangement activities. A study of the frequency of rearrangement activities is also presented. >
Hiroyuki Kitagawa - One of the best experts on this subject based on the ideXlab platform.
-
ICDE Workshops - Processing XPath Queries in PC-Clusters Using XML Data Partitioning
22nd International Conference on Data Engineering Workshops (ICDEW'06), 2006Co-Authors: K. Kido, Toshiyuki Amagasa, Hiroyuki KitagawaAbstract:Recently, with the rapid spread of XML format, it has become popular that large-scale data, whose size range from several hundreds of MB to several GB, are described by XML. For the purpose of providing fast and reliable means for storage and retrieval of huge XML data, it is a reasonable choice for us to use XML databases. In fact, there are many ways to realize XML databases, but relational XML database, in that an XML data is mapped to relational tables and query processing is enabled in terms of SQL queries, is one of the most popular way to implement XML databases. However, some researchers have pointed out that the performance of relational XML databases degrades when dealing with such huge XML data. In this study, we propose a scheme for parallel processing of XML data using PC Clusters. First, we discuss how to decompose XML data so that we can perform parallel processing of XML queries. We give the definitions of vertical and Horizontal Decomposition of XML data based on Decomposition of schema graph and XML instances, respectively. To allocate decomposed XML data to cluster nodes, we give an algorithm for computing pseudo-optimal assignment of XML fragments like greedy method in the light of XML query workload. Finally, we experimentally evaluate the effectiveness of the proposed method.
-
design and evaluation of signature file organization incorporating vertical and Horizontal Decomposition schemes
Database and Expert Systems Applications, 1996Co-Authors: Hiroyuki Kitagawa, Noriyasu Watanabe, Yoshiharu IshikawaAbstract:Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and Horizontal Decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.
-
DEXA - Design and Evaluation of Signature File Organization Incorporating Vertical and Horizontal Decomposition Schemes
Lecture Notes in Computer Science, 1996Co-Authors: Hiroyuki Kitagawa, Noriyasu Watanabe, Yoshiharu IshikawaAbstract:Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and Horizontal Decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.
Chintau Lea - One of the best experts on this subject based on the ideXlab platform.
-
tradeoff of Horizontal Decomposition versus vertical stacking in rearrangeable nonblocking networks
IEEE Transactions on Communications, 1991Co-Authors: Chintau Lea, D J ShyyAbstract:A class of rearrangeable nonblocking networks is presented. The proposed networks are fault-tolerant, self-routing, and intended for a very-high-speed environment. Self-routing networks have one major problem when applied to switching: they are blocking networks. To solve this problem, two methods have been used to create self-routing rearrangeable nonblocking networks: Horizontal cascading (HC) and vertical stacking (VS). The authors unify the two approaches and propose a novel class of switching networks. The proposed design principle allows the best tradeoffs among design parameters such as fault tolerance, hardware cost, and the frequency of rearrangement activities. A study of the frequency of rearrangement activities is also presented. >
Noriyasu Watanabe - One of the best experts on this subject based on the ideXlab platform.
-
design and evaluation of signature file organization incorporating vertical and Horizontal Decomposition schemes
Database and Expert Systems Applications, 1996Co-Authors: Hiroyuki Kitagawa, Noriyasu Watanabe, Yoshiharu IshikawaAbstract:Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and Horizontal Decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.
-
DEXA - Design and Evaluation of Signature File Organization Incorporating Vertical and Horizontal Decomposition Schemes
Lecture Notes in Computer Science, 1996Co-Authors: Hiroyuki Kitagawa, Noriyasu Watanabe, Yoshiharu IshikawaAbstract:Signature files are known as promising facilities to speed up accesses to large information repositories in database and information retrieval systems. This paper presents a new signature file organization method, named Partitioned Frame-Sliced Signature File (P-FSSF), and studies its performance. P-FSSF incorporates both vertical and Horizontal Decomposition schemes to reduce page accesses required to look up signatures. In addition, P-FSSF is flexible enough to have its concrete organization tuned to real application environments. We develop formulas to estimate the retrieval cost of P-FSSF in the context of the general set-valued object retrieval. Also, formulas to tell the update and storage costs are derived. Then, the processing cost of P-FSSF is shown to be lower than the other existing signature file organizations in general. We also show that Partitioned Bit-Sliced Signature File (P-BSSF), which is a special case of P-FSSF, is appropriate organization in most probable cases through the study of the optimal parameter values for P-FSSF.