43 citations · 107 across the 27 of their papers we have counts for
15 papers · 1 filter
Learned spatial data partitioning
Keizo Hori, Yuya Sasaki, Daichi Amagata +2
Due to the significant increase in the size of spatial data, it is essential to use distributed parallel processing systems to efficiently analyze spatial data. In this paper, we f…
GuP: Fast Subgraph Matching by Guard-based Pruning
Junya Arai, Yasuhiro Fujiwara, Makoto Onizuka
Subgraph matching, which finds subgraphs isomorphic to a query, is the key to information retrieval from data represented as a graph. To avoid redundant exploration in the data, ex…
Scardina: Scalable Join Cardinality Estimation by Multiple Density Estimators
Ryuichi Ito, Yuya Sasaki, Chuan Xiao +1
In recent years, machine learning-based cardinality estimation methods are replacing traditional methods. This change is expected to contribute to one of the most important applica…
NoSQL Schema Design for Time-Dependent Workloads
Yusuke Wakuta, Michael Mior, Teruyoshi Zenmyo +2
In this paper, we propose a schema optimization method for time-dependent workloads for NoSQL databases. In our proposed method, we migrate schema according to changing workloads,…
Journey of Migrating Millions of Queries on The Cloud
Taro L. Saito, Naoki Takezoe, Yukihiro Okada +11
Treasure Data is processing millions of distributed SQL queries every day on the cloud. Upgrading the query engine service at this scale is challenging because we need to migrate a…
Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach
Daichi Amagata, Makoto Onizuka, Takahiro Hara
Distance-based outlier detection is widely adopted in many fields, e.g., data mining and machine learning, because it is unsupervised, can be employed in a generic metric space, an…
Smart City Data Analysis via Visualization of Correlated Attribute Patterns
Yuya Sasaki, Keizo Hori, Daiki Nishihara +9
Urban conditions are monitored by a wide variety of sensors that measure several attributes, such as temperature and traffic volume. The correlations of sensors help to analyze and…
Fast Subgraph Matching by Exploiting Search Failures
Junya Arai, Makoto Onizuka, Yasuhiro Fujiwara +1
Subgraph matching is a compute-intensive problem that asks to enumerate all the isomorphic embeddings of a query graph within a data graph. This problem is generally solved with ba…
Sequenced Route Query with Semantic Hierarchy
Yuya Sasaki, Yoshiharu Ishikawa, Yasuhiro Fujiwara +1
The trip planning query searches for preferred routes starting from a given point through multiple Point-of-Interests (PoI) that match user requirements. Although previous studies…
Consistent and Flexible Selectivity Estimation for High-Dimensional Data
Yaoshu Wang, Chuan Xiao, Jianbin Qin +5
Selectivity estimation aims at estimating the number of database objects that satisfy a selection criterion. Answering this problem accurately and efficiently is essential to many…
Language-aware Indexing for Conjunctive Path Queries
Yuya Sasaki, George Fletcher, Makoto Onizuka
Conjunctive path queries (CPQ) are one of the most frequently used queries for complex graph analysis. However, current graph indexes are not tailored to fully support the power of…
Monotonic Cardinality Estimation of Similarity Selection: A Deep Learning Approach
Yaoshu Wang, Chuan Xiao, Jianbin Qin +4
Due to the outstanding capability of capturing underlying data distributions, deep learning techniques have been recently utilized for a series of traditional database problems. In…
Making View Update Strategies Programmable - Toward Controlling and Sharing Distributed Data -
Yasuhito Asano, Soichiro Hidaka, Zhenjiang Hu +10
Views are known mechanisms for controlling access of data and for sharing data of different schemas. Despite long and intensive research on views in both the database community and…
A View-based Programmable Architecture for Controlling and Integrating Decentralized Data
Yasuhito Asano, Soichiro Hidaka, Zhenjiang Hu +9
The view and the view update are known mechanism for controlling access of data and for integrating data of different schemas. Despite intensive and long research on them in both t…
Fast and Exact Top-k Search for Random Walk with Restart
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuka +1
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity scor…