default search action
Tatsuo Tsuji
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c43]Faruk Hossen, K. M. Azharul Hasan, H. M. Abdul Fattah, Tatsuo Tsuji:
Partial Dominance: A New Framework for Top-k Dominating Queries on Highly Incomplete Data. ICCCNT 2023: 1-6 - 2022
- [j16]H. M. Abdul Fattah
, K. M. Azharul Hasan
Weighted top-k dominating queries on highly incomplete data. Inf. Syst. 107: 102008 (2022) - [c42]Ken Higuchi, Ami Miyazaki, Kenya Hasegawa, Tatsuo Tsuji:
Data Structures for Routing Table of the Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method. SNPD-Summer 2022: 101-106 - 2021
- [j15]Mehnuma Tabassum Omar, K. M. Azharul Hasan
A scalable array storage for efficient maintenance of future data. J. Supercomput. 77(7): 6540-6565 (2021) - [c41]Ken Higuchi, Kenya Hasegawa, Tatsuo Tsuji:
Redundancy of Routing Information on the Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method. ACIT 2021: 69-73
2010 – 2019
- 2019
- [c40]Ken Higuchi, Jin Murayama, Tatsuo Tsuji:
A Load Balancing Method for Distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph. SNPD 2019: 472-477 - 2017
- [c39]Atsushi Sudoh, Tatsuo Tsuji, Ken Higuchi:
A Partitioning Scheme for Big Dynamic Trees. DASFAA Workshops 2017: 18-34 - [c38]Ken Higuchi, Makoto Yoshida, Tatsuo Tsuji, Naoyuki Miyamoto:
Correctness of the routing algorithm for distributed key-value store based on order preserving linear hashing and skip graph. SNPD 2017: 459-464 - 2016
- [j14]Masafumi Makino, Tatsuo Tsuji, Ken Higuchi:
History-Pattern Encoding for Large-Scale Dynamic Multidimensional Datasets and Its Evaluations. IEICE Trans. Inf. Syst. 99-D(4): 989-999 (2016) - [c37]Ken Higuchi, Naoyuki Miyamoto, Tatsuo Tsuji, Makoto Yoshida, Kento Takehara:
Performance evaluation of routing algorithms for distributed key-value store based on order preserving linear hashing and Skip graph. ICIS 2016: 1-6 - [c36]Yohsuke Chiba, Shogo Kitajima, Tatsuo Tsuji, Ken Higuchi:
A scheme of dynamic attributes addition for tuple datasets. iiWAS 2016: 288-292 - 2015
- [j13]Naoyuki Miyamoto, Ken Higuchi, Tatsuo Tsuji:
Incremental Data Migration for Multi-Database Systems Based on MySQL with SPIDER Storage Engines. Int. J. Networked Distributed Comput. 3(2): 119-127 (2015) - [c35]Masafumi Makino, Tatsuo Tsuji, Ken Higuchi:
History-Pattern Implementation for Large-Scale Dynamic Multidimensional Datasets and Its Evaluations. DASFAA (2) 2015: 275-291 - 2014
- [c34]Tatsuo Tsuji, Ryota Shimono, Ken Higuchi:
Design and Evaluation of a Storage Framework for Supply Chain Management. DEXA (2) 2014: 392-408 - [c33]Naoyuki Miyamoto, Ken Higuchi, Tatsuo Tsuji:
Incremental Data Migration for Multi-database Systems Based on MySQL with Spider Storage Engine. IIAI-AAI 2014: 745-750 - 2013
- [c32]Tatsuo Tsuji, Keita Amaki, Hiroomi Nishino, Ken Higuchi:
History-Offset Implementation Scheme of XML Documents and Its Evaluations. DASFAA (1) 2013: 315-330 - 2012
- [j12]Dong Jin, Tatsuo Tsuji:
A New Parallel Data Cube Construction Scheme. Int. J. Grid High Perform. Comput. 4(2): 32-45 (2012) - [c31]Ryota Shimono, Tatsuo Tsuji, Ken Higuchi:
A proposal of storage scheme for supply chain management. iiWAS 2012: 263-266 - [c30]Ken Higuchi, Wenqian Wang, Tatsuo Tsuji:
Incremental Data Migration for Multi-database Systems. SNPD 2012: 716-720 - 2011
- [j11]Teppei Shimada, Takayuki Tsuchida, Tatsuo Tsuji, Ken Higuchi:
Distributed construction of data cubes from tuple stream. Int. J. Bus. Intell. Data Min. 6(3): 302-320 (2011) - [j10]Li Bei, Tatsuo Tsuji, Ken Higuchi:
Resizable Multidimensional Arrays. Int. J. Comput. Their Appl. 18(1): 1-12 (2011) - [c29]Takayuki Tsuchida, Tatsuo Tsuji, Ken Higuchi:
Implementing Vertical Splitting for Large Scale Multidimensional Datasets and Its Evaluations. DaWaK 2011: 208-223 - [c28]Rakibul Islam, K. M. Azharul Hasan
EaCRS: an extendible array based compression scheme for high dimensional data. SoICT 2011: 92-99 - [c27]Dong Jin, Tatsuo Tsuji:
Parallel Data Cube Construction Based on an Extendible Multidimensional Array. TrustCom 2011: 1139-1145 - 2010
- [j9]Li Bei, Katsuya Kawaguchi, Tatsuo Tsuji, Ken Higuchi:
A Labeling Scheme for Dynamic XML Trees Based on History-offset Encoding. Inf. Media Technol. 5(2): 549-565 (2010) - [c26]Teppei Shimada, Takayuki Tsuchida, Tatsuo Tsuji, Ken Higuchi:
Distributed construction of data cubes from tuple stream. iiWAS 2010: 584-591 - [c25]Teppei Shimada, Hideo Sasahara, Tatsuo Tsuji, Ken Higuchi:
A scheme of aggregating stream data. SMC 2010: 699-704 - [c24]Ken Higuchi, Tatsuo Tsuji:
A distributed linear hashing enabling efficient retrieval for range queries. SMC 2010: 838-842
2000 – 2009
- 2009
- [j8]Dong Jin, Tatsuo Tsuji, Ken Higuchi:
An Incremental Maintenance Scheme of Data Cubes and Its Evaluation. Inf. Media Technol. 4(2): 364-376 (2009) - [j7]Teppei Shimada, Tatsuo Tsuji, Ken Higuchi:
A Secondary Storage Scheme for Multidimensional Data Preserving Proximity. J. Digit. Inf. Manag. 7(4): 227-234 (2009) - [c23]Ken Higuchi, Tatsuo Tsuji:
A Linear Hashing Enabling Efficient Retrieval for Range Queries. SMC 2009: 4557-4562 - 2008
- [j6]Takayuki Tsuchida, Teppei Shimada, Tatsuo Tsuji, Ken Higuchi:
Information Storage and Retrieval Schemes for Recycling Products. J. Softw. 3(6): 37-45 (2008) - [c22]Dong Jin, Tatsuo Tsuji, Takayuki Tsuchida, Ken Higuchi:
An Incremental Maintenance Scheme of Data Cubes. DASFAA 2008: 172-187 - [c21]Tatsuo Tsuji, Dong Jin, Ken Higuchi:
Data Compression for Incremental Data Cube Maintenance. DASFAA 2008: 682-685 - [c20]Teppei Shimada, Tatsuo Tsuji, Ken Higuchi:
A storage scheme for multidimensional data alleviating dimension dependency. ICDIM 2008: 662-668 - [c19]Tatsuo Tsuji, Masayuki Kuroda, Ken Higuchi:
History offset implementation scheme for large scale multidimensional data sets. SAC 2008: 1021-1028 - 2007
- [c18]K. M. Azharul Hasan, Tatsuo Tsuji, Ken Higuchi:
An Efficient Implementation for MOLAP Basic Data Structure and Its Evaluation. DASFAA 2007: 288-299 - [c17]Takayuki Tsuchida, Tatsuo Tsuji, Ken Higuchi:
Considerations on information storage and retrieval systems for recycling objects. SMC 2007: 2302-2307 - 2006
- [j5]K. M. Azharul Hasan, Tatsuo Tsuji, Ken Higuchi:
A Parallel Implementation Scheme of Relational Tables Based on Multidimensional Extendible Array. Int. J. Data Warehous. Min. 2(4): 66-85 (2006) - [c16]Masakazu Kumakiri, Li Bei, Tatsuo Tsuji, Ken Higuchi:
Flexibly Resizable Multidimensional Arrays. ICDE Workshops 2006: 126 - [c15]Tatsuo Tsuji, Akihiro Hara, Ken Higuchi:
An extendible multidimensional array system for MOLAP. SAC 2006: 503-510 - 2005
- [c14]K. M. Azharul Hasan, Masayuki Kuroda, Naoki Azuma, Tatsuo Tsuji, Ken Higuchi:
An Extendible Array Based Implementation of Relational Tables for Multi Dimensional Databases. DaWaK 2005: 233-242 - [c13]Masayuki Kuroda, Naoki Amma, K. M. Azharul Hasan
An Implementation Scheme of Relational Tables. ICDE Workshops 2005: 1244 - [c12]Takeshi Horie, Takuya Ukon, Tatsuo Tsuji, Ken Higuchi:
An Efficient Parallel Retrieval for Complex Object Index. ICDE Workshops 2005: 1266 - [c11]Takeshi Horie, Takuya Ukon, Tatsuo Tsuji, Ken Higuchi:
An Efficient Parallel Retrieval for Complex Object Index. ICDE Workshops 2005: 1268 - 2003
- [c10]Takeshi Horie, Kazuhiro Ogura, Tatsuo Tsuji, Ken Higuchi, Teruhisa Hochin:
Parallel Retrieval of Complex Object Index for Complex Queries. CATA 2003: 193-197 - 2002
- [j4]Tatsuo Tsuji, Albert Vreto, Ken Higuchi, Teruhisa Hochin:
A Two Dimensional Parallel Indexing Scheme for Complex Objects. Int. J. Comput. Their Appl. 9(2): 67-78 (2002) - [c9]Tatsuo Tsuji, Atsuo Isshiki, Teruhisa Hochin, Ken Higuchi:
An Implementation Scheme of Multidimensional Arrays for MOLAP. DEXA Workshops 2002: 773-778 - 2001
- [c8]Tatsuo Tsuji, Hidetatsu Kawahara, Teruhisa Hochin, Ken Higuchi:
Sharing Extendible Arrays in a Distributed Environment. IICS 2001: 41-52
1990 – 1999
- 1999
- [c7]Teruhisa Hochin, Tatsuo Tsuji:
A Method of Constructing Dynamic Schema Representing the Structure of Semistructured Data. IDEAS 1999: 103-108 - 1998
- [c6]Teruhisa Hochin, Tatsuo Tsuji:
A Storage Structure for Graph-Oriented Databases Using an Array of Element Types. Great Lakes Symposium on VLSI 1998: 452- - [c5]Teruhisa Hochin, Mitsuru Nakata, Tatsuo Tsuji:
A Flexible Kernel Data Model for Bottom-Up Databases and Management of Relationships. IDEAS 1998: 170-177 - [c4]Teruhisa Hochin, Masanori Harada, Mitsuru Nakata, Tatsuo Tsuji:
Virtual multimedia objects as the platform of customizing multimedia data. MSE 1998: 18-25 - 1997
- [j3]Kazuhiro Ogura, Tatsuo Tsuji, Albert Vreto, Teruhisa Hochin:
Index splitting for complex objects in parallel environments. Syst. Comput. Jpn. 28(9): 1-10 (1997) - [c3]Mitsuru Nakata, Teruhisa Hochin, Tatsuo Tsuji:
Bottom-up Scientific Databases Based on Sets and Their Top-Down Usage. IDEAS 1997: 171-179 - 1996
- [c2]Kazuhiro Ogura, Tatsuo Tsuji, Teruhisa Hochin:
Index Splitting for Complex Objects in Parallel Environments. CODAS 1996: 561-564 - 1995
- [c1]Albert Vreto, Kazuhiro Ogura, Tatsuo Tsuji, Teruhisa Hochin:
An Indexing Scheme in Distributed Object-Oriented Databases. Parallel and Distributed Computing and Systems 1995: 54-62
1980 – 1989
- 1988
- [j2]Tatsuo Tsuji, Katsumasa Watanabe, Athushi Ikehata:
Structured FORTRAN Preprocessors Generating Optimized Output. Softw. Pract. Exp. 18(5): 427-442 (1988) - 1987
- [j1]Tatsuo Tsuji, Kazuto Kontani, Katsumasa Watanabe, Mitsuaki Sumiya:
A method of constructing large-scale program processor for 8-bit system utilizing memory mapping feature. Syst. Comput. Jpn. 18(10): 35-46 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-07 00:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: