Faculty Profiles - ISHIKAWA, Yoshiharu

Papers - ISHIKAWA, Yoshiharu

Division display 241 - 260 of about 320 ／ All the affair displays >>

Efficient Query Autocompletion with Edit Distance-based Error Tolerance Reviewed International coauthorship

Jianbin Qin, Chuan Xiao, Sheng Hu, Jie Zhang, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane

The VLDB Journal Vol. 29 ( 4 ) page： 919 - 943 2020.7

NGNC: A Flexible and Efficient Framework for Error-Tolerant Query Autocompletion Reviewed

Yukai Miao, Jianbin Qin, Sheng Hu, Yuyang Dong, Yoshiharu Ishikawa, Makoto Onizuka

Fourth Workshop on Software Foundations for Data Interoperability (SFDI 2020) page： 101-115 2020.9

機械学習を用いた近似的問合せ処理

倪天嘉, 石川佳治, 杉浦健人

第19回情報科学技術フォーラム (FIT 2020) page： D-002 2020.9

3次元TINデータ上での空間的スカイライン問合せ

笠井雄太, 杉浦健人, 石川佳治

第19回情報科学技術フォーラム (FIT 2020) page： D-003 2020.9

Rethinking the Local Similarity in Content-based Image Retrieval

Longjiao Zhao, Yu Wang, Yoshiharu Ishikawa, Jien Kato

電子情報通信学会パターン認識・メディア理解研究会 2020.12

Generalizing the Pigeonhole Principle for Similarity Search in Hamming Space Reviewed International coauthorship

Qin J., Xiao C., Wang Y., Wang W., Lin X., Ishikawa Y., Wang G.

IEEE Transactions on Knowledge and Data Engineering Vol. 33 ( 2 ) page： 489 - 505 2021.2

Language：Japanese Publishing type：Research paper (scientific journal) Publisher：IEEE Transactions on Knowledge and Data Engineering

A distance search in Hamming space finds binary vectors whose Hamming distances are no more than a threshold from a query vector. It is a fundamental problem in many applications, such as image retrieval, near-duplicate Web page detection, and scientific databases. State-of-the-art approaches to Hamming distance search are mainly based on the pigeonhole principle to generate a set of candidates and then verify them. We observe that the constraint by the pigeonhole principle is not always tight and may bring about unnecessary candidates. We also observe that the distribution in real data is often skewed, but most existing solutions adopt a simple equi-width partitioning and allocate the same threshold to all the parts, hence failing to exploit the data skewness to optimize query processing. In this paper, we propose a new form of the pigeonhole principle which allows variable partitioning and threshold allocation. Based on the new principle, we develop a tight constraint of candidates and devise cost-aware methods for partitioning and threshold allocation to optimize query processing. In addition, we extend our methods to answer Hamming distance join queries. We also discuss the application of the pigeonhole principle in set similarity search, a problem that can be converted to Hamming distance search equivalently. Our evaluation on datasets with various data distributions shows the robustness of our solution and its superior query processing performance to the state-of-the-art methods.

DOI： 10.1109/TKDE.2019.2899597

Scopus

誤差を保証する近似的問合せについて

倪天嘉, 杉浦健人, 石川佳治

第13回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2021) page： B11-2 2021.3

TIN上での空間的スカイライン問合せ

笠井雄太, 杉浦健人, 石川佳治

第13回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2021) page： A21-4 2021.3

エッジコンピューティング環境における低遅延かつ高可用な耐障害性保証

高尾大樹, 杉浦健人, 石川佳治

第13回データ工学と情報マネジメントに関するフォーラム (DEIM Forum 2021) page： J24-4 2021.3

マルチバージョン索引構造P-Treeの性能評価

野原健汰, 杉浦健人, 石川佳治

情報処理学会第83回全国大会 page： 5L-04 2021.3

不揮発性メモリのための索引手法の分析

西村学, 杉浦健人, 石川佳治

情報処理学会第83回全国大会 page： 5L-06 2021.3

機械学習による空間索引の性能評価

鈴木駿也, 杉浦健人, 石川佳治

情報処理学会第83回全国大会 page： 5L-08 2021.3

都市のサステナビリティ及びレジリエンス分析のためのインタフェースの開発

山本孝生, 石川佳治, 杉浦健人, 朴秀日, 加藤博和

情報処理学会第83回全国大会 page： 6L-07 2021.3

Approximate Streaming Aggregation with Low-Latency and High-Reliability for Edge Computing Reviewed

TAKAO Daiki, SUGIURA Kento, ISHIKAWA Yoshiharu

Vol. J104-D ( 5 ) page： 463 - 475 2021.5

Language：Japanese Publishing type：Research paper (scientific journal) Publisher：The Institute of Electronics, Information and Communication Engineers

Edge computing enables communication traffic reduction and load balancing by simple data processing like aggregation or filtering at network edges. Low latency, high reliability, and fault tolerance are important requirements for edge computing applications. In this paper, we assume applications for environmental sensing and propose an approximate streaming aggregation algorithm that meets these requirements. Our method provides the result with theoretical error bounds, even if there are missing data due to sensor failures or communication failures. Furthermore, our method reduces latency by outputting the result when meeting user requirements and guarantees fault tolerance approximately by estimating the lost state.

DOI： 10.14923/transinfj.2020dep0004

CiNii Research

Consistent and Flexible Selectivity Estimation for High-Dimensional Data Reviewed International coauthorship

Yaoshu Wang, Chuan Xiao, Jianbin Qin, Rui Mao, Makoto Onizuka, Wei Wang, Rui Zhang, Yoshiharu Ishikawa

Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD 2021) page： 2319 - 2327 2021.6

Spatial Skyline Queries on Triangulated Irregular Networks Reviewed

Kasai Y., Sugiura K., Ishikawa Y.

ACM International Conference Proceeding Series page： 64 - 73 2021.8

Language：English Publishing type：Research paper (international conference proceedings) Publisher：ACM International Conference Proceeding Series

A spatial skyline query is a query to find a set of data points that are not spatially dominated by other data points, given a set of data points P and query points Q in a multidimensional space. The query enumerates the skyline points based on distance in a multidimensional space. However, existing spatial skyline queries can lead to large errors with actual travel distances in geo-spaces because the query is based on the Euclidean distance. We propose a spatial skyline query on triangulated irregular networks (TINs), which are frequently used to represent the surfaces of terrain. We define a new spatial skyline query based on more accurate travel distances considering the TIN distance instead of the Euclidean distance. We also propose an efficient solution method using indexes to find nearest-neighbor points in TIN space and reduce the numbers of unnecessary data points and TIN vertices. The proposed method achieves a computational complexity of O(|P′||Q|N′2 + |P′|2|Q|), where P′ and N′ are the reduced sets of data points and number of TIN vertices, respectively, based on the range of query points. The proposed method can process a query faster than the naive method with T(|P||Q|N2 + |P|2|Q|), where N is the number of TIN vertices. Moreover, experiments verify that the proposed method is faster than the naive method by using a spatial index to reduce the numbers of unnecessary data points and TIN vertices.

DOI： 10.1145/3469830.3470901

Scopus

エッジコンピューティングにおける時間的相関を考慮した近似的耐障害性保証

高尾大樹, 杉浦健人, 石川佳治, 陸可鏡

第20回情報科学技術フォーラム (FIT 2021) 2021.8

IoT環境におけるデータベースを用いた点群管理の検討

松本佳大, 杉浦健人, 石川佳治, 陸可鏡

第20回情報科学技術フォーラム (FIT 2021) 2021.8

誤差の保証がある近似的問合せ処理に関する研究

倪天嘉, 杉浦健人, 石川佳治, 陸可鏡

第20回情報科学技術フォーラム (FIT 2021) 2021.8

ロックフリー索引のための基礎ベンチマークの作成及び性能検証

牧田直樹, 杉浦健人, 石川佳治, 陸可鏡

第20回情報科学技術フォーラム (FIT 2021) 2021.8

　 PREV - NEXT 　

<ISHIKAWA, Yoshiharu>

Papers - ISHIKAWA, Yoshiharu