Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mostofa Kamal Rasel

dblp:177/0980 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0003-3051-3838ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
iterative query processing
0.412019
Iterative Query Processing based on Unified Optimization Techniques · SIGMOD Conference 2019
Query processing and optimization
cost model
0.112019
Iterative Query Processing based on Unified Optimization Techniques · SIGMOD Conference 2019

Methods — techniques the papers use, named apart from their topics

query motion · 0.4loop-invariant code motion · 0.4
YearPublicationVenuePosition
2019 Iterative Query Processing based on Unified Optimization Techniques
abstract
Hybrid transactional and analytical processing (HTAP) systems like SAP HANA make it much simpler to manage both operational load and analytical queries without ETL, separate data warehouses, et al. To represent both transactional and analytical business logic in a single database system, stored procedures are often used to express analytical queries using control flow logic and DMLs. Optimizing these complex procedures requires a fair knowledge of imperative programming languages as well as the declarative query language. Therefore, unified optimization techniques considering both program and query optimization techniques are essential for achieving optimal query performance. In this paper, we propose a novel unified optimization technique for efficient iterative query processing. We present a notion of query motion that allows the movement of SQL queries in and out of a loop. Additionally, we exploit a new cost model that measures the quality of the execution plan with consideration for queries and loop iterations. We describe our experimental evaluation that demonstrates the benefit of our technique using both a standard decision support benchmark and real-world workloads. An extensive evaluation shows that our unified optimization technique enumerates plans that achieve performance improvements of up to an order of magnitude faster than plans generated by the existing loop-invariant code motion technique.
Kisung Park 0001, Hojin Seo, Mostofa Kamal Rasel, Young-Koo Lee, Chanho Jeong, Sung Yeol Lee, Chungmin Lee, Donghun Lee 0001
SIGMOD Conference3
2018 Summarized bit batch-based triangle listing in massive graphs
Mostofa Kamal Rasel, En Elena, Young-Koo Lee
Inf. Sci.1
2017 Disk-based shortest path discovery using distance index over large dynamic graphs
Jihye Hong, Kisung Park 0001, Yongkoo Han, Mostofa Kamal Rasel, Dawanga Vonvou, Young-Koo Lee
Inf. Sci.4
2016 iTri: Index-based triangle listing in massive graphs
Mostofa Kamal Rasel, Yongkoo Han, Jinseung Kim, Kisung Park 0001, Nguyen Anh Tu, Young-Koo Lee
Inf. Sci.1
2016 Topic modeling and improvement of image representation for large-scale image retrieval
Nguyen Anh Tu, Dong-Luong Dinh, Mostofa Kamal Rasel, Young-Koo Lee
Inf. Sci.3