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

Lev Novik

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

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

Databases, data management, data science and information retrieval · 5 · 1 since 2021Artificial intelligence and machine learning · 1Theory of computation · 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
5 papers
Indexing and storage engines · 20% Query processing and optimization · 20% Data stream processing · 18%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 50% High-performance computing · 32% Cloud and datacenter computing · 19%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query execution
index-based query processing
0.512021
Hyperspace: The Indexing Subsystem of Azure Synapse · Proc. VLDB Endow. 2021
Indexing and storage engines
index management
0.512021
Hyperspace: The Indexing Subsystem of Azure Synapse · Proc. VLDB Endow. 2021
Distributed systems › distributed data processing
distributed indexing
0.412020
Helios: Hyperscale Indexing for the Cloud & Edge · Proc. VLDB Endow. 2020
High-performance computing › data-intensive computing
large-scale data processing
0.412020
Helios: Hyperscale Indexing for the Cloud & Edge · Proc. VLDB Endow. 2020
Information retrieval › document retrieval › domain-specific retrieval
enterprise search
0.212015
Annotating Database Schemas to Help Enterprise Search · Proc. VLDB Endow. 2015
Data models and query languages › query interface
query inference from examples
0.212014
Discovering queries based on example tuples · SIGMOD Conference 2014
Cloud and datacenter computing
database-as-a-service
0.112011
Adapting microsoft SQL server for cloud computing · ICDE 2011
Distributed systems › replication
primary-backup replication
0.112011
Adapting microsoft SQL server for cloud computing · ICDE 2011
Distributed systems
replication
0.112011
Adapting microsoft SQL server for cloud computing · ICDE 2011

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

distributed systems design · 0.9concurrency control · 0.5shared-nothing partitioning · 0.2spreadsheet mining · 0.2keyword extraction · 0.2query discovery algorithms · 0.2
YearPublicationVenuePosition
2021 Hyperspace: The Indexing Subsystem of Azure Synapse
abstract
Microsoft recently introduced Azure Synapse Analytics, which offers an integrated experience across data ingestion, storage, and querying in Apache Spark and T-SQL over data in the lake, including files and warehouse tables. In this paper, we present our experiences with designing and implementing Hyperspace, the indexing subsystem underlying Synapse. Hyperspace enables users to build multiple types of secondary indexes on their data, maintain them through a multi-user concurrency model, and leverage them automatically---without any change to their application code---for query/workload acceleration. Many requirements of Hyperspace are based on feedback from several enterprise customers. We present the details of Hyperspace's underlying design, the user-facing APIs, its concurrency control protocol for index access, its index-aware query processing techniques, and its maintenance mechanisms for handling index updates. Evaluations over standard industry benchmarks and real customer workloads show that Hyperspace can accelerate query execution by up to 10x and in certain real-world workloads, even up to two orders of magnitude.
Rahul Potharaju, Terry Kim, Eunjin Song, Wentao Wu 0001, Lev Novik, Apoorve Dave, Pouria Pirzadeh, Andrew Fogarty, Gurleen Dhody, Jiying Li, Vidip Acharya, Sinduja Ramanujam, Nicolas Bruno, César A. Galindo-Legaria, Vivek R. Narasayya, Surajit Chaudhuri, Anil K. Nori, Tomas Talius, Raghu Ramakrishnan 0001
Proc. VLDB Endow.5
2020 Helios: Hyperscale Indexing for the Cloud & Edge
abstract
Helios is a distributed, highly-scalable system used at Microsoft for flexible ingestion, indexing, and aggregation of large streams of real-time data that is designed to plug into relational engines. The system collects close to a quadrillion events indexing approximately 16 trillion search keys per day from hundreds of thousands of machines across tens of data centers around the world. Helios use cases within Microsoft include debugging/diagnostics in both public and government clouds, workload characterization, cluster health monitoring, deriving business insights and performing impact analysis of incidents in other large-scale systems such as Azure Data Lake and Cosmos. Helios also serves as a reference blueprint for other large-scale systems within Microsoft. We present the simple data model behind Helios, which offers great flexibility and control over costs, and enables the system to asynchronously index massive streams of data. We also present our experiences in building and operating Helios over the last five years at Microsoft.
Rahul Potharaju, Terry Kim, Wentao Wu 0001, Vidip Acharya, Steve Suh, Andrew Fogarty, Apoorve Dave, Sinduja Ramanujam, Tomas Talius, Lev Novik, Raghu Ramakrishnan 0001
Proc. VLDB Endow.10
2015 Annotating Database Schemas to Help Enterprise Search
abstract
In large enterprises, data discovery is a common problem faced by users who need to find relevant information in relational databases. In this scenario, schema annotation is a useful tool to enrich a database schema with descriptive keywords. In this paper, we demonstrate Barcelos, a system that automatically annotates corporate databases. Unlike existing annotation approaches that use Web oriented knowledge bases, Barcelos mines enterprise spreadsheets to find candidate annotations. Our experimental evaluation shows that Barcelos produces high quality annotations; the top-5 have an average precision of 87%.
Eli Cortez, Philip A. Bernstein, Yeye He, Lev Novik
Proc. VLDB Endow.4
2014 Discovering queries based on example tuples
abstract
An enterprise information worker is often aware of a few example tuples (but not the entire result) that should be present in the output of the query. We study the problem of discovering the minimal project join query that contains the given example tuples in its output. Efficient discovery of such queries is challenging. We propose novel algorithms to solve this problem. Our experiments on real-life datasets show that the proposed solution is significantly more efficient compared with na\"{i}ve adaptations of known techniques.
Yanyan Shen, Kaushik Chakrabarti, Surajit Chaudhuri, Bolin Ding, Lev Novik
SIGMOD Conference5
2011 Adapting microsoft SQL server for cloud computing
abstract
Cloud SQL Server is a relational database system designed to scale-out to cloud computing workloads. It uses Microsoft SQL Server as its core. To scale out, it uses a partitioned database on a shared-nothing system architecture. Transactions are constrained to execute on one partition, to avoid the need for two-phase commit. The database is replicated for high availability using a custom primary-copy replication scheme. It currently serves as the storage engine for Microsoft's Exchange Hosted Archive and SQL Azure.
Philip A. Bernstein, Istvan Cseri, Nishant Dani, Nigel Ellis, Ajay Kalhan, Gopal Kakivaya, David B. Lomet, Ramesh Manne, Lev Novik, Tomas Talius
ICDE9
1992 A Cooperative Answering System
Terry Gaasterland, Parke Godfrey, Jack Minker, Lev Novik
LPAR4