Performance estimation of selecting and inserting procedures in the structure-independent database

Sviridov, Alexander; Grishchenko, Andrey; Belousova, Svetlana A.

doi:10.1109/icaict.2014.7035943

Cited by 1 publication

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The theta-join operation has also been implemented in popular database management systems such as Oracle database 26 , PostgreSql database 27 , etc. However, the theta-join's efficiency is heavily affected by the number of involved time-consuming Cartesian products 17,28 . Handling the theta-join in a careless way can result in the number of Cartesian products grows drastically, and will even lead to an exponential surge if multi-way theta-join is conducted.…”

Section: Figurementioning

confidence: 99%

“…However, the theta-join's efficiency is heavily affected by the number of involved time-consuming Cartesian products. 17,28 Handling the theta-join in a careless way can result in the number of Cartesian products grows drastically, and will even lead to an exponential surge if multiway theta-join is conducted. The unacceptably large number of Cartesian products also become a curse, especially in distributed environments [29][30][31] where the incurred I/O overhead and the communication cost 25 make it an influential factor that dramatically compromises the efficiency of the theta-join operation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Toward fast theta‐join: A prefiltering and amalgamated partitioning approach

Wang

Fan

et al. 2022

Concurrency and Computation

View full text Add to dashboard Cite

As one of the most useful online processing techniques, the theta‐join operation has been utilized by many applications to fully excavate the relationships between data streams in various scenarios. As such, constant research efforts have been put to optimize its performance in the distributed environment, which is typically characterized by reducing the number of Cartesian products as much as possible. In this article, we design and implement a novel fast theta‐join algorithm, called Prefap, by developing two distinct techniques—prefiltering and amalgamated partitioning—based on the state‐of‐the‐art FastThetaJoin algorithm to optimize the efficiency of the theta‐join operation. Firstly, we develop a prefiltering strategy before data streams are partitioned to reduce the amount of data to be involved and benefit a more fine‐grained partitioning. Secondly, to avoid the data streams being partitioned in a coarse‐grained isolated manner and improve the quality of the partition‐level filtering, we introduce an amalgamated partitioning mechanism that can amalgamate the partitioning boundaries of two data streams to assist a fine‐grained partitioning. With the integration of these two techniques into the existing FastThetaJoin algorithm, we design and implement a new framework to achieve a decreased number of Cartesian products and a higher theta‐join efficiency. By comparing with existing algorithms, FastThetaJoin in particular, we evaluate the performance of Prefap on both synthetic and real data streams from two‐way to multiway theta‐join to demonstrate its superiority.

show abstract

Section: Figurementioning

confidence: 99%