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

Nitish Upreti

dblp:117/9319 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021

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
Indexing and storage engines · 45% Information retrieval · 27% Database system architecture and tuning · 27%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 48% Storage systems · 40% Cloud and datacenter computing · 12%

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

TopicWeightPapersLastEvidence papers
Information retrieval › similarity search › nearest neighbor search
approximate nearest neighbor search
0.912025
Cost-Effective, Low Latency Vector Search with Azure Cosmos DB · Proc. VLDB Endow. 2025
Indexing and storage engines
vector index
0.912025
Cost-Effective, Low Latency Vector Search with Azure Cosmos DB · Proc. VLDB Endow. 2025
Indexing and storage engines
index maintenance
0.312017
Resumable Online Index Rebuild in SQL Server · Proc. VLDB Endow. 2017
Indexing and storage engines › index maintenance
online index rebuild
0.312017
Resumable Online Index Rebuild in SQL Server · Proc. VLDB Endow. 2017
Storage systems
storage reliability
0.312017
Resumable Online Index Rebuild in SQL Server · Proc. VLDB Endow. 2017
Distributed systems
distributed database
0.312025
Cost-Effective, Low Latency Vector Search with Azure Cosmos DB · Proc. VLDB Endow. 2025
Cloud and datacenter computing
database-as-a-service
0.112017
Resumable Online Index Rebuild in SQL Server · Proc. VLDB Endow. 2017
Distributed systems
database availability
0.112017
Resumable Online Index Rebuild in SQL Server · Proc. VLDB Endow. 2017

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

partitioning · 1.7DiskANN · 1.7state persistence · 0.6incremental work units · 0.6
YearPublicationVenuePosition
2025 Cost-Effective, Low Latency Vector Search with Azure Cosmos DB
abstract
Vector indexing enables semantic search over diverse corpora and has become an important interface to databases for both users and AI agents. Efficient vector search requires deep optimizations in database systems. This has motivated a new class of specialized vector databases that optimize for vector search quality and cost. Instead, we argue that a scalable, high-performance, and cost-efficient vector search system can be built inside a cloud-native operational database like Azure Cosmos DB while leveraging the benefits of a distributed database such as high availability, durability, and scale. We do this by deeply integrating DiskANN, a state-of-the-art vector indexing library, inside Azure Cosmos DB NoSQL. This system uses a single vector index per partition stored in existing index trees, and kept in sync with underlying data. It supports < 20ms query latency over an index spanning 10 million vectors, has stable recall over updates, and offers approximately 43× and 12× lower query cost compared to Pinecone and Zilliz serverless enterprise products. It also scales out to billions of vectors via automatic partitioning. This convergent design presents a point in favor of integrating vector indices into operational databases in the context of recent debates on specialized vector databases, and offers a template for vector indexing in other databases.
Nitish Upreti, Harsha Vardhan Simhadri, Hari Sudan Sundar, Krishnan Sundaram, Samer Boshra, Balachandar Perumalswamy, Shivam Atri, Martin Chisholm, Revti Raman Singh, Greg Yang, Tamara Hass, Nitesh Dudhey, Subramanyam Pattipaka, Mark Hildebrand, Magdalen Dobson, Jack Moffitt, Naren Datha, Suryansh Gupta, Ravishankar Krishnaswamy, Hemeswari Varada, Sudhanshu Barthwal, Ritika Mor, James Codella, Shaun Cooper, Kevin Pilch, Simon Moreno, Aayush Kataria, Neil Deshpande, Amar Sagare, Dinesh Billa, Zishan Fu, Vipul Vishal
Proc. VLDB Endow.1
2017 Resumable Online Index Rebuild in SQL Server
abstract
Azure SQL Database and the upcoming release of SQL Server enhance Online Index Rebuild to provide fault-tolerance and allow index rebuild operations to resume after a system failure or a user-initiated pause. SQL Server is the first commercial DBMS to support pause and resume functionality for index rebuilds. This is achieved by splitting the operation into incremental units of work and persisting the required state so that it can be resumed later with minimal loss of progress. At the same time, the proposed technology minimizes the log space required for the operation to succeed, making it possible to rebuild large indexes using only a small, constant amount of log space. These capabilities are critical to guarantee the reliability of these operations in an environment where a) the database sizes are increasing at a much faster pace compared to the available hardware, b) system failures are frequent in Cloud architectures using commodity hardware, c) software upgrades and other maintenance tasks are automatically handled by the Cloud platforms, introducing further unexpected failures for the users and d) most modern applications need to be available 24/7 and have very tight maintenance windows. This paper describes the design of "Resumable Online Index Rebuild" and discusses how this technology can be extended to cover more schema management operations in the future.
Panagiotis Antonopoulos, Hanuma Kodavalla, Alex Tran, Nitish Upreti, Chaitali Shah, Mirek Sztajno
Proc. VLDB Endow.4