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

Praynaa Rawlani

dblp:149/5914 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

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

Databases, data management, data science and information retrieval · 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
1 paper
Graph data management · 44% Query processing and optimization · 44% Database system architecture and tuning · 13%

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

TopicWeightPapersLastEvidence papers
Graph data management
graph analytics
0.212014
VERTEXICA: Your Relational Friend for Graph Analytics! · Proc. VLDB Endow. 2014
Database system architecture and tuning › relational database system
relational database integration
0.112014
VERTEXICA: Your Relational Friend for Graph Analytics! · Proc. VLDB Endow. 2014

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

SQL · 0.2
YearPublicationVenuePosition
2014 VERTEXICA: Your Relational Friend for Graph Analytics!
abstract
In this paper, we present Vertexica, a graph analytics tools on top of a relational database, which is user friendly and yet highly efficient. Instead of constraining programmers to SQL, Vertexica offers a popular vertex-centric query interface, which is more natural for analysts to express many graph queries. The programmers simply provide their vertex-compute functions and Vertexica takes care of efficiently executing them in the standard SQL engine. The advantage of using Vertexica is its ability to leverage the relational features and enable much more sophisticated graph analysis. These include expressing graph algorithms which are difficult in vertex-centric but straightforward in SQL and the ability to compose end-to-end data processing pipelines, including pre- and post- processing of graphs as well as combining multiple algorithms for deeper insights. Vertexica has a graphical user interface and we outline several demonstration scenarios including, interactive graph analysis, complex graph analysis, and continuous and time series analysis.
Alekh Jindal, Praynaa Rawlani, Eugene Wu 0002, Samuel Madden 0001, Amol Deshpande, Michael Stonebraker
Proc. VLDB Endow.2