Demo Data from VLDB 2026 / reviewers in the wild / expert
Narayanan Krishnakumar
dblp:12/3590
· DBLP profile ↗
8ranked-venue papers
7as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 4 first-authorSystems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-authorTheory of computation · 1 · 1 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
3 papers |
Distributed and cloud data management · 42% Transaction processing and concurrency control · 29% Data integration and cleaning · 29% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Distributed systems · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
replication |
0.0 | 2 | 1994 | Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System · ACM Trans. Database Syst. 1994 Bounded Ignorance in Replicated Systems · PODS 1991 |
Distributed and cloud data management
data replication |
0.0 | 2 | 1992 | High Throughput Escrow Algorithms for Replicated Databases · VLDB 1992 Bounded Ignorance in Replicated Systems · PODS 1991 |
Data integration and cleaning › data quality
integrity constraint violation |
0.0 | 1 | 1994 | Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System · ACM Trans. Database Syst. 1994 |
Transaction processing and concurrency control › serializability
relaxed serializability |
0.0 | 1 | 1994 | Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System · ACM Trans. Database Syst. 1994 |
Distributed systems › replication › replica control
replicated data concurrency control |
0.0 | 1 | 1994 | Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System · ACM Trans. Database Syst. 1994 |
Methods — techniques the papers use, named apart from their topics
state reachability analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Escrow techniques for mobile sales and inventory applications
Narayanan Krishnakumar, Ravi Jain |
Wirel. Networks | 1 |
| 1996 | Guest Editors' Introduction
Daniel Barbará, Ravi Jain, Narayanan Krishnakumar |
Distributed Parallel Databases | 3 |
| 1995 | Managing Hetergeneous Multi-system Tasks to Support Enterprise-Wide Operations
Narayanan Krishnakumar, Amit P. Sheth |
Distributed Parallel Databases | 1 |
| 1994 | On Computing Serial Dependency Relations
Narayanan Krishnakumar |
J. Comput. Syst. Sci. | 1 |
| 1994 | Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated SystemabstractDatabases are replicated to improve performance and availability. The notion of correctness that has commonly been adopted for concurrent access by transactions to shared, possibly replicated, data is serializability. However, serializability may be impractical in high-performance applications since it imposes too stringent a restriction on concurrency. When serializability is relaxed, the integrity constraints describing the data may be violated. By allowing bounded violations of the integrity constraints, however, we are able to increase the concurrency of transactions that execute in a replicated environment. In this article, we introduce the notion of an N-ignorant transaction, which is a transaction that may be ignorant of the results of at most N prior transactions, which is a transaction that may be ignorant of the results of at most N prior transactions. A system in which all transactions are N-ignorant can have an N + 1-fold increase in concurrency over serializable systems, at the expense of bounded violations of its integrity constraints. We present algorithms for implementing replicated databases in N-ignorant systems. We then provide constructive methods for calculating the reachable states in such systems, given the value of N , so that one may assess the maximum liability that is incurred in allowing constraint violation. Finally, we generalize the notion of N-ignorance to a matrix of ignorance for the purpose of higher concurrency. Narayanan Krishnakumar, Arthur J. Bernstein |
ACM Trans. Database Syst. | 1 |
| 1992 | High Throughput Escrow Algorithms for Replicated Databases
Narayanan Krishnakumar, Arthur J. Bernstein |
VLDB | 1 |
| 1991 | Fault Tolerant Based Embeddings of Quadtrees into Hypercubes
Narayanan Krishnakumar, Vinayak Hegde, S. Sitharama Iyengar |
ICPP (3) | 1 |
| 1991 | Bounded Ignorance in Replicated SystemsabstractArticle Bounded ignorance in replicated systems Share on Authors: Narayanan Krishnakumar Dept. of Computer Science, SUNY at Stony Brook, Stony Brook, NY Dept. of Computer Science, SUNY at Stony Brook, Stony Brook, NYView Profile , Arthur J. Bernstein Dept. of Computer Science, SUNY at Stony Brook, Stony Brook, NY Dept. of Computer Science, SUNY at Stony Brook, Stony Brook, NYView Profile Authors Info & Claims PODS '91: Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsApril 1991 Pages 63–74https://doi.org/10.1145/113413.113419Online:01 April 1991Publication History 36citation278DownloadsMetricsTotal Citations36Total Downloads278Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access Narayanan Krishnakumar, Arthur J. Bernstein |
PODS | 1 |