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.

Navin Kabra

dblp:k/NavinKabra · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Databases, data management, data science and information retrieval · 6 · 3 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
5 papers
Query processing and optimization · 61% Information retrieval · 19% Database system architecture and tuning · 11%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 9 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
retrieval models
0.012003
The QUIQ Engine: A Hybrid IR DB System · ICDE 2003
Query processing and optimization › query optimization › query optimizer architecture
query optimizer extensibility
0.011999
OPT++: An Object-Oriented Implementation for Extensible Database Query Optimization · VLDB J. 1999
Query processing and optimization › adaptive query processing
mid-query re-optimization
0.011998
Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans · SIGMOD Conference 1998
Query processing and optimization › adaptive query processing
query re-optimization
0.011998
Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans · SIGMOD Conference 1998
Query processing and optimization
parallel query processing
0.011997
Building a Scaleable Geo-Spatial DBMS: Technology, Implementation, and Evaluation · SIGMOD Conference 1997
Database system architecture and tuning › database system implementation
client-server database
0.011994
Client-Server Paradise · VLDB 1994
Programming languages and type systems
object-oriented programming
0.011999
OPT++: An Object-Oriented Implementation for Extensible Database Query Optimization · VLDB J. 1999
Query processing and optimization
query execution
0.011998
Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans · SIGMOD Conference 1998
Distributed systems › distributed system architecture
client-server systems
0.011994
Client-Server Paradise · VLDB 1994

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

performance evaluation · 0.0spatial partitioning · 0.0parallel query execution · 0.0
YearPublicationVenuePosition
2004 Mass Collaboration: A Case Study
Raghu Ramakrishnan 0001, Andrew Baptist, Vuk Ercegovac, Matt Hanselman, Navin Kabra, Amit Marathe, Uri Shaft
IDEAS5
2003 The QUIQ Engine: A Hybrid IR DB System
abstract
For applications that involve rapidly changing textual data and also require traditional DBMS capabilities, current systems are unsatisfactory. We describe a hybrid IR-DB system that serves as the basis for the QUIQ-Connect product, a collaborative customer support application. We present a novel query paradigm and system architecture, along with performance results.
Navin Kabra, Raghu Ramakrishnan 0001, Vuk Ercegovac
ICDE1
1999 OPT++: An Object-Oriented Implementation for Extensible Database Query Optimization
Navin Kabra, David J. DeWitt
VLDB J.1
1998 Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans
abstract
For a number of reasons, even the best query optimizers can very often produce sub-optimal query execution plans, lead-ing to a significant degradation of performance. This is es-pecially true in databases used for complex decision support queries and/or object-relational databases. In this paper, we describe an algorithm that detects sub-optimality of a query execution plan during query execution and attempts to correct the problem. The basic idea is to collect statis-tics at key points during the execution of a complex query. These statistics are then used to optimize the execution of the query, either by improving the resource allocation for that query, or by changing the execution plan for the re-mainder of the query. To ensure that this does not signifi-cantly slow down the normal execution of a query, the Query Optimizer carefully chooses what statistics to collect, when to collect them, and the circumstances under which to re-optimize the query. We describe an implementation of this algorithm in the Paradise Database System, and we report on performance studies, which indicate that this can result in significant improvements in the performance of complex queries. 1
Navin Kabra, David J. DeWitt
SIGMOD Conference1
1997 Building a Scaleable Geo-Spatial DBMS: Technology, Implementation, and Evaluation
abstract
This paper presents a number of new techniques for parallelizing geo-spatial database systems and discusses their implementation in the Paradise object-relational database system. The effectiveness of these techniques is demonstrated using a variety of complex geo-spatial queries over a 120 GB global geo-spatial data set.
Jignesh M. Patel, Jie-Bing Yu, Navin Kabra, Kristin Tufte, Biswadeep Nag, Josef Burger, Nancy E. Hall, Karthikeyan Ramasamy, Roger Lueder, Curt J. Ellmann, Jim Kupsch, Shelly Guo, David J. DeWitt, Jeffrey F. Naughton
SIGMOD Conference3
1994 Client-Server Paradise
David J. DeWitt, Navin Kabra, Jignesh M. Patel, Jie-Bing Yu
VLDB2