.png){kind=icon}
返回
Performance analysis of three text-join algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/69.687979.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When a multidatabase system contains textual database systems (i.e., information retrieval systems), queries against the global schema of the multidatabase system may contain a new type of joins-joins between attributes of textual type. Three algorithms for processing such a type of joins are presented and their I/O costs are analyzed in this paper. Since such a type of joins often involves document collections of very large size, it is very important to find efficient algorithms to process them. The three algorithms differ on whether the documents themselves or the inverted files on the documents are used to process the join. Our analysis and the simulation results indicate that the relative performance of these algorithms depends on the input document collections, system characteristics, and the input query. For each algorithm, the type of input document collections with which the algorithm is likely to perform well is identified. An integrated algorithm that automatically selects the best algorithm to use is also proposed.
Keyword:
query processing
textual database
information retrieval
join algorithm
multidatabase
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
Comparison of Insulin-mediated and Glucose-mediated Glucose Disposal in Patients with Insulin-dependent Diabetes Mellitus and in Nondiabetic Subjects.png)
Diabetes
DiabetesIF0
PREAI
分享收藏
查看更多内容