Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Nipun Agarwal is active.

Publication


Featured researches published by Nipun Agarwal.


international conference on data engineering | 2000

Extensible indexing: a framework for integrating domain-specific indexing schemes into Oracle8i

Jagannathan Srinivasan; Ravi Murthy; Seema Sundara; Nipun Agarwal; Samuel DeFazio

Extensible indexing is a SQL-based framework that allows users to define domain-specific indexing schemes, and integrate them into the Oracle8i server. Users register a new indexing scheme, the set of related operators, and additional properties through SQL data definition language extensions. The implementation for an indexing scheme is provided as a set of Oracle Data Cartridge Interface (ODCIIndex) routines for index-definition, index-maintenance, and index-scan operations. An index created using the new indexing scheme, referred to as domain index, behaves and performs analogous to those built natively by the database system. The Oracle8i server implicitly invokes user-supplied index implementation code when domain index operations are performed, and executes user-supplied index scan routines for efficient evaluation of domain-specific operators. This paper provides an overview of the framework and describes the steps needed to implement an indexing scheme. The paper also presents a case study of Oracle Cartridges (intermedia text, spatial, and visual information retrieval), and Daylight (Chemical compound searching) Cartridge, which have implemented new indexing schemes using this framework and discusses the benefits and limitations.


international conference on management of data | 2005

Towards an enterprise XML architecture

Ravi Murthy; Zhen Hua Liu; Muralidhar Krishnaprasad; Sivasankaran Chandrasekar; Anh-Tuan Tran; Eric Sedlar; Daniela Florescu; Susan Kotsovolos; Nipun Agarwal; Vikas Arora; Viswanathan Krishnamurthy

XML is being increasingly used in diverse domains ranging from data and application integration to content management. Oracle provides an enterprise wide platform for managing all types of XML content. Within the Oracle database and the application server, the XML content can be efficiently stored using a variety of storage and indexing methods and it can be processed using multiple standard languages within different programmatic environments.


very large data bases | 2009

Binary XML storage and query processing in Oracle 11g

Ning Zhang; Nipun Agarwal; Sivasankaran Chandrasekar; Sam Idicula; Vijay Medi; Sabina Petride; Balasubramanyam Sthanikam

Oracle RDBMS has supported XML data management for more than six years since version 9i. Prior to 11g, text-centric XML documents can be stored as-is in a CLOB column and schema-based data-centric documents can be shredded and stored in object-relational (OR) tables mapped from their XML Schema. However, both storage formats have intrinsic limitations---XML/CLOB has unacceptable query and update performance, and XML/OR requires XML schema. To tackle this problem, Oracle 11g introduces a native Binary XML storage format and a complete stack of data management operations. Binary XML was designed to address a wide range of real application problems encountered in XML data management---schema flexibility, amenability to XML indexes, update performance, schema evolution, just to name a few. In this paper, we introduce the Binary XML storage format based on Oracle SecureFiles System[21]. We propose a lightweight navigational index on top of the storage and an NFA-based navigational algorithm to provide efficient streaming processing. We further optimize query processing by exploiting XML structural and schema information that are collected in database dictionary. We conducted extensive experiments to demonstrate high performance of the native Binary XML in query processing, update, and space consumption.


international conference on data engineering | 2003

Supporting ancillary values from user defined functions in Oracle

Ravi Murthy; Seema Sundara; Nipun Agarwal; Ying Hu; Timothy Chorma; Jagannathan Srinivasan

Most commercial SQL database systems support user-defined functions that can be used in WHERE clause filters, SELECT list items, or in sorting/grouping clauses. Often, user-defined functions are used as inexact search filters and then the filtered rows are sorted by a relevance measure. This is commonplace in Web search engines, multimedia, and personalization applications. We refer to the values, such as relevance measure, associated with the filtered rows as ancillary values, and address the problem of efficiently and expressively supporting queries involving them in Oracle. In our approach, the filtering operator is designated as the primary operator, and the associated ancillary values are modeled by additional operators that are declared to be ancillary to the primary operator. An ancillary operator can represent any auxiliary value for the filtered rows, including relevance values (e.g. a score which describes how well a document matches the text search query) and additional properties (e.g. the nature of spatial relationship for objects that overlap a given region). The query execution is optimized by allowing the primary and ancillary operator invocations to share computations via a shared context. Also, queries involving ancillary values can exploit user defined indexes and their capability to return results in the order of ancillary values. We present the key concepts, describes our implementation scheme and optimization techniques, and discusses alternative approaches for supporting ancillary values. Finally, we provide an experimental study that illustrates the scalability and effectiveness of our approach.


international symposium on microarchitecture | 2017

A many-core architecture for in-memory data processing

Sandeep R. Agrawal; Sam Idicula; Arun Raghavan; Evangelos Vlachos; Venkatraman Govindaraju; Venkatanathan Varadarajan; Cagri Balkesen; Georgios Giannikis; Charlie Roth; Nipun Agarwal; Eric Sedlar

For many years, the highest energy cost in processing has been data movement rather than computation, and energy is the limiting factor in processor design [21]. As the data needed for a single application grows to exabytes [56], there is clearly an opportunity to design a bandwidth-optimized architecture for big data computation by specializing hardware for data movement. We present the Data Processing Unit or DPU, a shared memory many-core that is specifically designed for high bandwidth analytics workloads. The DPU contains a unique Data Movement System (DMS), which provides hardware acceleration for data movement and partitioning operations at the memory controller that is sufficient to keep up with DDR bandwidth. The DPU also provides acceleration for core to core communication via a unique hardware RPC mechanism called the Atomic Transaction Engine. Comparison of a DPU chip fabricated in 40nm with a Xeon processor on a variety of data processing applications shows a 3× - 15× performance per watt advantage.CCS CONCEPTS• Computer systems organization


international conference on management of data | 2018

RAPID: In-Memory Analytical Query Processing Engine with Extreme Performance per Watt

Cagri Balkesen; Nitin Kunal; Georgios Giannikis; Pit Fender; Seema Sundara; Felix Schmidt; Jarod Wen; Sandeep R. Agrawal; Arun Raghavan; Venkatanathan Varadarajan; Anand Viswanathan; Balakrishnan Chandrasekaran; Sam Idicula; Nipun Agarwal; Eric Sedlar

\rightarrow


international congress on big data | 2017

Big Data Processing: Scalability with Extreme Single-Node Performance

Venkatraman Govindaraju; Sam Idicula; Sandeep R. Agrawal; Venkatanathan Vardarajan; Arun Raghavan; Jarod Wen; Cagri Balkesen; Georgios Giannikis; Nipun Agarwal; Eric Sedlar

Multicore architectures; Special purpose systems;


Archive | 2002

Mechanism for mapping XML schemas to object-relational database systems

Ravi Murthy; Muralidhar Krishnaprasad; Sivasankaran Chandrasekar; Eric Sedlar; Viswanathan Krishnamurthy; Nipun Agarwal

Today, an ever increasing amount of transistors are packed into processor designs with extra features to support a broad range of applications. As a consequence, processors are becoming more and more complex and power hungry. At the same time, they only sustain an average performance for a wide variety of applications while not providing the best performance for specific applications. In this paper, we demonstrate through a carefully designed modern data processing system called RAPID and a simple, low-power processor specially tailored for data processing that at least an order of magnitude performance/power improvement in SQL processing can be achieved over a modern system running on todays complex processors. RAPID is designed from the ground up with hardware/software co-design in mind to provide architecture-conscious extreme performance while consuming less power in comparison to the modern database systems. The paper presents in detail the design and implementation of RAPID, a relational, columnar, in-memory query processing engine supporting analytical query workloads.


Archive | 2002

Mechanisms for storing content and properties of hierarchically organized resources

Ravi Murthy; Eric Sedlar; Nipun Agarwal; Neema Jalali

Contemporary frameworks for data analytics, such as Hadoop, Spark, and Flink seek to allow applications to scale performance flexibly by adding hardware nodes. However, we find that when the computation on each individual node is optimized, peripheral activities such as creating data partitions, messaging and synchronizing between nodes diminish the speedup obtainable from adding more hardware. We analyze workloads which distribute operations on correlated data—such as joins and aggregation found in SQL, text similarity searches, and image disparity computations. After optimizing computation on efficient, custom processors, we discover challenges in scaling the applications to hundreds of nodes on a high-bandwidth network. We then describe techniques to overcome these challenges towards prototyping a 512-node system which is able to execute SQL queries offloaded from a commercial database, and outperform SQL-on-hadoop and traditional parallel RDBMS executions by 173x and 7x respectively.


Archive | 2002

Mechanism to efficiently index structured data that provides hierarchical access in a relational database system

Neema Jalali; Eric Sedlar; Nipun Agarwal; Ravi Murthy

Collaboration


Dive into the Nipun Agarwal's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge