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

Patrick Dantressangle

dblp:56/8510 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-0821-4164ORCID · corroborated

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

Databases, data management, data science and information retrieval · 3Systems, architecture and hardware · 1

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
2 papers
Graph data management · 46% Information retrieval · 23% Database system architecture and tuning · 15%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › cross-language information retrieval
query translation
0.212013
Building an efficient RDF store over a relational database · SIGMOD Conference 2013
Graph data management › RDF data management
RDF query processing
0.212013
Building an efficient RDF store over a relational database · SIGMOD Conference 2013
Graph data management › RDF data management
relational storage of RDF
0.212013
Building an efficient RDF store over a relational database · SIGMOD Conference 2013
Database system architecture and tuning › database administration
database migration
0.112010
MEET DB2: Automated Database Migration Evaluation · Proc. VLDB Endow. 2010

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

shredding of RDF into relational · 0.2query translation · 0.2static analysis · 0.1XQuery · 0.1XML · 0.1
YearPublicationVenuePosition
2017 An efficient hypercube labeling schema for dynamic Peer-to-Peer networks
Andi Toce, Abbe Mowshowitz, Akira Kawaguchi, Paul Stone, Patrick Dantressangle, Graham A. Bent
J. Parallel Distributed Comput.5
2013 Building an efficient RDF store over a relational database
abstract
Efficient storage and querying of RDF data is of increasing importance, due to the increased popularity and widespread acceptance of RDF on the web and in the enterprise. In this paper, we describe a novel storage and query mechanism for RDF which works on top of existing relational representations. Reliance on relational representations of RDF means that one can take advantage of 35+ years of research on efficient storage and querying, industrial-strength transaction support, locking, security, etc. However, there are significant challenges in storing RDF in relational, which include data sparsity and schema variability. We describe novel mechanisms to shred RDF into relational, and novel query translation techniques to maximize the advantages of this shredded representation. We show that these mechanisms result in consistently good performance across multiple RDF benchmarks, even when compared with current state-of-the-art stores. This work provides the basis for RDF support in DB2 v.10.1.
Mihaela A. Bornea, Julian Dolby, Anastasios Kementsietsidis, Kavitha Srinivas, Patrick Dantressangle, Octavian Udrea, Bishwaranjan Bhattacharjee
SIGMOD Conference5
2010 MEET DB2: Automated Database Migration Evaluation
abstract
Commercial databases compete for market share, which is composed of not only net-new sales to those purchasing a database for the first time, but also competitive "win-backs" and migrations. Database migration, or the act of moving both application code and its underlying database platform from one database to another, presents a serious administrative and application development challenge fraught with large manual costs. Migration is typically a high cost effort due to incompatibilities between database platforms. Incompatibilities are caused most often by product specific extensions to language support, procedural logic, DDL, and administrative interfaces. The migration evaluation is the first step in any competitive database migration process. Historically this has been a manual process, with the high costs and subjective results. This has led us to reexamine traditional practices and explore an automatic, innovative solution. We have designed and implemented the Migration Evaluation and Enablement Tool for DB2 for Linux Unix and Windows, or MEET DB2, a tool for automatically evaluating database migration projects. Encapsulated in a simple one-click interface, MEET DB2 is able to provide detailed evaluation of migration complexity based on its deep analysis on the source database. In this paper, we present MEET DB2, and discuss many aspects of our design, and report measurements from real-world use cases. In particular, we show a novel way to use XML and XQuery in this domain for better extensibility and interoperability. We have evaluated MEET DB2 on 18 source code samples, covering nearly 1 million lines of code. The utility has provided benefits in several dimensions including: dramatically reduced time for evaluation, consistency, improved accuracy over human analysis, improved reporting, reduced skill requirements for migration analysis, and clear analytics for product planning.
Reynold Xin, Patrick Dantressangle, Sam Lightstone, William McLaren, Steve Schormann, Maria Schwenger
Proc. VLDB Endow.2
2009 Technologies for federation and interoperation of coalition networks
Seraphin B. Calo, Petros Zerfos, David Vyvyan, Patrick Dantressangle, Graham A. Bent
FUSION5