Bartosz Bebel

dblp:61/1160 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0002-6426-3809ORCID · verified

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

Databases, data management, data science and information retrieval · 7 · 2 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021
YearPublicationVenuePosition
2025 Leveraging Machine Learning Techniques for Customer Data Deduplication - Hard-Won Lessons from a Real-World Project in the Financial Industry
Robert Wrembel, Witold Andrzejewski, Pawel Boinski, Bartosz Bebel
DaWaK4
2024 On tuning parameters guiding similarity computations in a data deduplication pipeline for customers records: Experience from a R&D project
Witold Andrzejewski, Bartosz Bebel, Pawel Boinski, Robert Wrembel
Inf. Syst.2
2023 On Tuning the Sorted Neighborhood Method for Record Comparisons in a Data Deduplication Pipeline - Industrial Experience Report
Pawel Boinski, Witold Andrzejewski, Bartosz Bebel, Robert Wrembel
DEXA (1)3
2023 Text Similarity Measures in a Data Deduplication Pipeline for Customers Records
Witold Andrzejewski, Bartosz Bebel, Pawel Boinski, Mariusz Sienkiewicz, Robert Wrembel
DOLAP2
2015 Sequential Data Analytics by Means of Seq-SQL Language
Bartosz Bebel, Tomasz Cichowicz, Tadeusz Morzy, Filip Rytwinski, Robert Wrembel, Christian Koncilia
DEXA (1)1
2012 FOCUS: An Index FOr ContinuoUS Subsequence Pattern Queries
Witold Andrzejewski, Bartosz Bebel
ADBIS2
2001 Hierarchical Materialisation of Methods in OO Views: Design, Maintenance, and Experimental Evaluation
abstract
The application of materialised object-oriented views in object-relational data warehousing systems is promising. In this paper we propose a novel technique for the materialisation of method results in object-oriented views, called hierarchical materialisation. When an object used to materialise the result of method m is updated, then m has to be recomputed. This recomputation can use unaffected intermediate materialised results of methods called from m, thus reducing a recomputation time. The hierarchical materialisation technique was implemented and evaluated by a number of experiments concerning methods without input arguments as well as methods with input arguments. The results showed that hierarchical materialisation reduces method recomputation time. Moreover, materialising methods with input arguments of narrow discrete domains introduces only a small time overhead.
Bartosz Bebel, Robert Wrembel
DOLAP1