Demo Data from EDBT 2026 / reviewers in the wild / expert
Sumanta Chatterjee
dblp:91/1046
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-authorDatabases, 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 |
Database system architecture and tuning · 77% Query processing and optimization · 23% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
parallel query processing |
0.0 | 1 | 1998 | 50,000 Users on an Oracle8 Universal Server Database · SIGMOD Conference 1998 |
Methods — techniques the papers use, named apart from their topics
resource sharing · 0.0process and buffer management · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Distributed Data Aggregation in Wireless Sensor Network - with Peer VerificationabstractData aggregation in wireless sensor network is implemented to reduce the communication overhead and to
reduce bandwidth utilization. Data confidentiality requires the sensor node to transmit the data in a secure
manner so that the adversary is unable to read the data or transmit false data even if it compromises some of
the sensor nodes or aggregation node. In this paper a distributed aggregation protocol using homomorphic
trapdoor permutation is proposed. This protocol distributes the responsibility of key generation , aggregation
and verification to different nodes to reduce the overall power consumption of the sensor network. The peer
verification scheme is also proposed as a part of the protocol. Peer verification ensures the authentication of
the data and sender node in the network, by at least k peer nodes. Security of the proposed protocol is analyzed
against passive and active adversary model. Sumanta Chatterjee, Alwyn Roshan Pais, Sumit Saurabh |
SECRYPT | 1 |
| 1998 | 50,000 Users on an Oracle8 Universal Server DatabaseabstractIn this paper, we describe the Oracle Large User Population Demonstration and highlight the scalability mechanisms in the Oracle8 Universal Data Server which make it possible to support as many as 50,000 concurrent users on a single Oracle8 database without any middle-tier TP-monitor software. Supporting such large user populations requires many mechanisms for high concurrency and throughput. Algorithms in all areas of the server ranging from process and buffer management to SQL compilation and execution must be designed to be highly scalable. Efficient resource sharing mechanisms are required to prevent server-side resource requirements from growing unboundedly with the number of users. Parallel execution across multiple systems is necessary to allow user-population and throughput to scale beyond the restrictions of a single system. In addition to scalability, mechanisms for high availability, ease-of-use, and rich functionality are necessary for supporting complex user applications typical of realistic workloads. All mechanisms must be portable to a wide variety of installations ranging from desk-top systems to large scale enterprise servers and to a wide variety of operating systems. Tirthankar Lahiri, Ashok Joshi, Amit Jasuja, Sumanta Chatterjee |
SIGMOD Conference | 4 |