![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Haruo Yokota Wenxin Liang , Haruo Yokota: A Path-sequence Based Discrimination for Subtree Matching in Approximate XML Joins. ICDE Workshops 2006 : 116 Tomohiro Yoshihara , Dai Kobayashi , Ryo Taguchi , Haruo Yokota: A Concurrency Control Method for Parallel Btree Structures. ICDE Workshops 2006 : 124 Kensuke Ohta , Dai Kobayashi , Takashi Kobayashi , Ryo Taguchi , Haruo Yokota: Treatment of Rules in Individual Metadata of Flexible Contents Management. ICDE Workshops 2006 : 125 Makoto Kataigi , Dai Kobayashi , Tomohiro Yoshihara , Takashi Kobayashi , Ryo Taguchi , Haruo Yokota: Evaluation of Placement and Access Asignment for Replicated Object Striping. ICDE Workshops 2006 : 129 Hideyuki Katoh , Takashi Kobayashi , Haruo Yokota: Activity Scheduling inWeb-Service Based Workflow Management for Balancing Load and Handling Failures. MDM 2006 : 135 Wenxin Liang , Haruo Yokota: LAX: An Efficient Approximate XML Join Based on Clustered Leaf Nodes for XML Data Integration. BNCOD 2005 : 82-97 Kazuhito Kobayashi , Wenxin Liang , Dai Kobayashi , Akitsugu Watanabe , Haruo Yokota: VLEI code: An Efficient Labeling Method for Handling XML Documents in an RDB. ICDE 2005 : 386-387 Akitsugu Watanabe , Haruo Yokota: Adaptive Lapped Declustering: A Highly Available Data-Placement Method Balancing Access Load and Space Utilization. ICDE 2005 : 828-839 Wataru Nakano , Yuta Ochi , Takashi Kobayashi , Yutaka Katsuyama , Satoshi Naoi , Haruo Yokota: Unified Presentation Contents Retrieval Using Laser Pointer Information. ICDE Workshops 2005 : 1261 Mana Nakano , Dai Kobayashi , Akitsugu Watanabe , Toshihiro Uehara , Ryo Taguchi , Haruo Yokota: The Versioning System Balancing Data Amount and Access Frequency on Distributed Storage System. ICDE Workshops 2005 : 1264 Dai Kobayashi , Akitsugu Watanabe , Ryo Taguchi , Toshihiro Uehara , Haruo Yokota: An Efficient Access Forwarding Method Based On Caches On Storage Nodes. ICDE Workshops 2005 : 1265 Hiroaki Okamoto , Takashi Kobayashi , Haruo Yokota: Presentation Retrieval Method Considering the Scope of Targets and Outputs. WIRI 2005 : 46-53 Neila Ben Lakhal , Takashi Kobayashi , Haruo Yokota: Reliability and Performance Estimation for Enriched WS-SAGAS. WIRI 2005 : 54-63 Jun Miyazaki , Yohei Abe , Haruo Yokota: Availabilities and Costs of Reliable Fat-Btrees. PRDC 2004 : 163-172 Neila Ben Lakhal , Takashi Kobayashi , Haruo Yokota: THROWS: An Architecture for Highly Available Distributed Execution of Web Services Compositions. RIDE 2004 : 103-110 Akitsugu Watanabe , Haruo Yokota: Directory-traverse-cost-based skew handling for parallel data access. Systems and Computers in Japan 34 (14): 13-22 (2003) Daisuke Ito , Haruo Yokota: Automatic Reconfiguration of an Autonomous Disk Cluster. PRDC 2001 : 169-172 Jun Miyazaki , Haruo Yokota: Performance evaluation of the CPPS distributed-memory parallel production system under various system parameters. Systems and Computers in Japan 31 (2): 83-93 (2000) Eiji Sugino , Haruo Yokota: Analysis for performance and reliability of fault-tolerant parallel software. Systems and Computers in Japan 31 (7): 56-65 (2000) Haruo Yokota: Autonomous Disks for Advanced Database Applications. DANTE 1999 : 435-442 Haruo Yokota, Yasuhiko Kanemasa , Jun Miyazaki : Fat-Btree: An Update-Conscious Parallel Directory Structure. ICDE 1999 : 448-457 Jun Miyazaki , Haruo Yokota: An Optimization Technique of Discrimination Networks in Active Database Systems for Massively Parallel Processing. CODAS 1996 : 565-568 Haruo Yokota, Hajime Kitakami , Akira Hattori : Term Indexing for Retrieval by Unification. ICDE 1989 : 313-320 Hidenori Itoh , Hidetoshi Monoi , Shigeki Shibayama , Nobuyoshi Miyazaki , Haruo Yokota, Akihiko Konagaya : Knowledge Base System in Logic Programming Paradigm. FGCS 1988 : 37-53 Hidenori Itoh , Toshiaki Takewaki , Haruo Yokota: Knowledge Base Machine Based on Parallel Kernel Language. IWDM 1987 : 17-30 Haruo Yokota, Sko Sakai , Hidenori Itoh : Deductive Database System based on Unit Resolution. ICDE 1986 : 228-235 Haruo Yokota, Hidenori Itoh : A Model and an Architecture for a Relational Knowledge Base. ISCA 1986 : 2-9 Yukihiro Morita , Haruo Yokota, Kenji Nishida , Hidenori Itoh : Retrieval-By-Unification Operation on a Relational Knowledge Base. VLDB 1986 : 52-59 Takeo Kakuta , Nobuyoshi Miyazaki , Shigeki Shibayama , Haruo Yokota, Kunio Murakami : The Design and Implementation of Relational Database Machine Delta. IWDM 1985 : 13-34 Shigeki Shibayama , Takeo Kakuta , Nobuyoshi Miyazaki , Haruo Yokota, Kunio Murakami : Query Processing Flow on RDBM Delta's Functionally-Distributed Architecture. FGCS 1984 : 427-435 Haruo Yokota, Susumu Kunifuji , Takeo Kakuta , Nobuyoshi Miyazaki , Shigeki Shibayama , Kunio Murakami : An Enhanced Inference Mechanism for Generating Relational Algebra Queries. PODS 1984 : 229-238 Taizo Miyachi , Susumu Kunifuji , Hajime Kitakami , Koichi Furukawa , Akikazu Takeuchi , Haruo Yokota: A Knowledge Assimilation Method for Logic Databases. SLP 1984 : 118-125 Shigeki Shibayama , Takeo Kakuta , Nobuyoshi Miyazaki , Haruo Yokota, Kunio Murakami : A Relational Database Machine with Large Semiconductor Disk and Hardware Relational Algebra Processor New Generation Comput. 2 (2): 131-155 (1984) Taizo Miyachi , Susumu Kunifuji , Hajime Kitakami , Koichi Furukawa , Akikazu Takeuchi , Haruo Yokota: A Knowledge Assimilation Method for Logic Databases. New Generation Comput. 2 (4): 385-404 (1984) Kunio Murakami , Takeo Kakuta , Nobuyoshi Miyazaki , Shigeki Shibayama , Haruo Yokota: A Relational Data Base Machine: First Step to Knowledge Base Machine ISCA 1983 : 423-425 1 [ 22 ] 2 [ 2 ] [ 4 ] 3 [ 13 ] 4 [ 19 ] 5 [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] 6 [ 1 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] 7 [ 15 ] 8 [ 32 ] 9 [ 31 ] 10 [ 27 ] 11 [ 2 ] [ 4 ] [ 13 ] 12 [ 25 ] [ 26 ] [ 29 ] [ 32 ] [ 33 ] [ 34 ] 13 [ 29 ] 14 [ 21 ] [ 23 ] [ 24 ] [ 27 ] [ 31 ] [ 32 ] [ 33 ] 15 [ 12 ] 16 [ 2 ] [ 4 ] [ 5 ] 17 [ 21 ] [ 23 ] 18 [ 29 ] [ 30 ] [ 35 ] 19 [ 2 ] [ 4 ] 20 [ 14 ] [ 15 ] [ 18 ] [ 22 ] 21 [ 1 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 12 ] 22 [ 12 ] 23 [ 8 ] 24 [ 1 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] 25 [ 26 ] 26 [ 27 ] 27 [ 27 ] 28 [ 8 ] 29 [ 27 ] 30 [ 33 ] 31 [ 24 ] 32 [ 10 ] 33 [ 1 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 12 ] 34 [ 17 ] 35 [ 25 ] [ 26 ] [ 32 ] [ 33 ] [ 34 ] 36 [ 2 ] [ 4 ] 37 [ 11 ] 38 [ 25 ] [ 26 ] 39 [ 20 ] [ 25 ] [ 26 ] [ 28 ] [ 29 ] 40 [ 32 ] [ 34 ] ![]() ©2006 Association for Computing Machinery |