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

Marcello Buoncristiano

dblp:07/7259 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2016
0000-0003-2022-7475ORCID · corroborated

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

Databases, data management, data science and information retrieval · 3

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
3 papers
Data integration and cleaning · 91% Web and social media mining · 7% Query processing and optimization · 2%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data integration and cleaning › data extraction
web data extraction
0.322016
Joint repairs for web wrappers · ICDE 2016
WADaR: Joint Wrapper and Data Repair · Proc. VLDB Endow. 2015
Data integration and cleaning › data preprocessing › data cleaning
data repair
0.212015
WADaR: Joint Wrapper and Data Repair · Proc. VLDB Endow. 2015
Data integration and cleaning
schema mapping
0.112009
Concise and Expressive Mappings with +Spicy · Proc. VLDB Endow. 2009
Data integration and cleaning › schema mapping
schema mapping discovery
0.112009
Concise and Expressive Mappings with +Spicy · Proc. VLDB Endow. 2009
Data integration and cleaning › data extraction
wrapper maintenance
0.112015
WADaR: Joint Wrapper and Data Repair · Proc. VLDB Endow. 2015
Query processing and optimization
query rewriting
0.012009
Concise and Expressive Mappings with +Spicy · Proc. VLDB Endow. 2009

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

approximation algorithm · 0.2XPath-based wrapper · 0.2NP-completeness analysis · 0.2markov chain · 0.2entity recognition · 0.2rewriting algorithm · 0.1
YearPublicationVenuePosition
2016 Joint repairs for web wrappers
abstract
Automated web scraping is a popular means for acquiring data from the web. Scrapers (or wrappers) are derived from either manually or automatically annotated examples, often resulting in under/over segmented data, together with missing or spurious content. Automatic repair and maintenance of the extracted data is thus a necessary complement to automatic wrapper generation. Moreover, the extracted data is often the result of a long-term data acquisition effort and thus jointly repairing wrappers together with the generated data reduces future needs for data cleaning. We study the problem of computing joint repairs for XPath-based wrappers and their extracted data. We show that the problem is NP-complete in general but becomes tractable under a few natural assumptions. Even tractable solutions to the problem are still impractical on very large datasets, but we propose an optimal approximation that proves effective across a wide variety of domains and sources. Our approach relies on encoded domain knowledge, but require no per-source supervision. An evaluation spanning more than 100k web pages from 100 different sites of a wide variety of application domains, shows that joint repairs are able to increase the quality of wrappers between 15% and 60% independently of the wrapper generation system, eliminating all errors in more than 50% of the cases.
Stefano Ortona, Giorgio Orsi 0001, Tim Furche, Marcello Buoncristiano
ICDE4
2015 WADaR: Joint Wrapper and Data Repair
abstract
Web scraping (or wrapping) is a popular means for acquiring data from the web. Recent advancements have made scalable wrapper-generation possible and enabled data acquisition processes involving thousands of sources. This makes wrapper analysis and maintenance both needed and challenging as no scalable tools exists that support these tasks. We demonstrate WADaR, a scalable and highly automated tool for joint wrapper and data repair. WADaR uses off-the-shelf entity recognisers to locate target entities in wrapper-generated data. Markov chains are used to determine structural repairs, that are then encoded into suitable repairs for both the data and corresponding wrappers. We show that WADaR is able to increase the quality of wrapper-generated relations between 15% and 60%, and to fully repair the corresponding wrapper without any knowledge of the original website in more than 50% of the cases.
Stefano Ortona, Giorgio Orsi 0001, Marcello Buoncristiano, Tim Furche
Proc. VLDB Endow.3
2009 Concise and Expressive Mappings with +Spicy
abstract
We introduce the +Spicy mapping system. The system is based on a number of novel algorithms that contribute to increase the quality and expressiveness of mappings. +Spicy integrates the computation of core solutions in the mapping generation process in a highly efficient way, based on a natural rewriting of the given mappings. This allows for an efficient implementation of core computations using common runtime languages like SQL or XQuery and guarantees very good performances, orders of magnitude better than those of previous algorithms. The rewriting algorithm can be applied both to mappings generated by the system, or to pre-defined mappings provided as part of the input. To do this, the system was enriched with a set of expressive primitives, so that +Spicy is the first mapping system that brings together a sophisticate and expressive mapping generation algorithm with an efficient strategy to compute core solutions.
Giansalvatore Mecca, Paolo Papotti, Salvatore Raunich, Marcello Buoncristiano
Proc. VLDB Endow.4