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

Ramkumar Krishnan

dblp:05/4051 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

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

Databases, data management, data science and information retrieval · 5Artificial intelligence and machine learning · 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
4 papers
Data stream processing · 44% Indexing and storage engines · 24% Database system architecture and tuning · 15%

Topics — the 6 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data stream processing
complex event processing
0.112009
Microsoft CEP Server and Online Behavioral Targeting · Proc. VLDB Endow. 2009
Indexing and storage engines
b+-tree
0.012001
B+-Tree Indexes with Hybrid Row Identifiers in Oracle8i · ICDE 2001
Database system architecture and tuning
extensible database system
0.012001
The Importance of Extensible Database Systems for E-Commerce · ICDE 2001
Data stream processing
continuous query processing
0.012009
Microsoft CEP Server and Online Behavioral Targeting · Proc. VLDB Endow. 2009
Data models and query languages
object-relational database
0.012001
The Importance of Extensible Database Systems for E-Commerce · ICDE 2001
Indexing and storage engines › storage management
storage structures
0.012000
Oracle8i Index-Organized Table and Its Application to New Domains · VLDB 2000

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

lazy index maintenance · 0.0
YearPublicationVenuePosition
2009 Microsoft CEP Server and Online Behavioral Targeting
abstract
In this demo, we present the Microsoft Complex Event Processing (CEP) Server, Microsoft CEP for short. Microsoft CEP is an event stream processing system featured by its declarative query language and its multiple consistency levels of stream query processing. Query composability, query fusing, and operator sharing are key features in the Microsoft CEP query processor. Moreover, the debugging and supportability tools of Microsoft CEP provide visibility of system internals to users. Web click analysis has been crucial to behavior-based online marketing. Streams of web click events provide a typical workload for a CEP server. Meanwhile, a CEP server with its processing capabilities plays a key role in web click analysis. This demo highlights the features of Microsoft CEP under a workload of web click events.
Mohamed H. Ali, Ciprian Gerea, Balan Sethu Raman, Beysim Sezgin, Tiho Tarnavski, Tomer Verona, Peter Zabback, Anton Kirilov, Asvin Ananthanarayan, Alex Raizman, Ramkumar Krishnan, Roman Schindlauer, Torsten Grabs, Sharon Bjeletich, Badrish Chandramouli, Jonathan Goldstein, Sudin Bhat, Vincenzo Di Nicola, Xianfang Wang, David Maier 0001, Ivo Santos, Olivier Nano, Stephan Grell
Proc. VLDB Endow.13
2002 A mapping mechanism to support bitmap index and other auxiliary structures on tables stored as primary B±trees
abstract
Any auxiliary structure, such as a bitmap or a B+-tree index, that refers to rows of a table stored as a primary B+-tree (e.g., tables with clustered index in Microsoft SQL Server, or index-organized tables in Oracle) by their physical addresses would require updates due to inherent volatility of those addresses. To address this problem, we propose a mapping mechanism that 1) introduces a single mapping table, with each row holding one key value from the primary B+-tree, as an intermediate structure between the primary B+-tree and the associated auxiliary structures, and 2) augments the primary B+-tree structure to include in each row the physical address of the corresponding mapping table row. The mapping table row addresses can then be used in the auxiliary structures to indirectly refer to the primary B+-tree rows. The two key benefits are: 1) the mapping table shields the auxiliary structures from the volatility of the primary B+-tree row addresses, and 2) the method allows reuse of existing conventional table mechanisms for supporting auxiliary structures on primary B+-trees. The mapping mechanism is used for supporting bitmap indexes on index-organized tables in Oracle9i. The analytical and experimental studies show that the method is storage efficient, and (despite the mapping table overhead) provides performance benefits that are similar to those provided by bitmap indexes implemented on conventional tables.
Eugene Inseok Chong, Jagannathan Srinivasan, Souripriya Das, Chuck Freiwald, Aravind Yalamanchi, Mahesh Jagannath, Anh-Tuan Tran 0005, Ramkumar Krishnan, Richard Jiang 0002
CIKM8
2001 B+-Tree Indexes with Hybrid Row Identifiers in Oracle8i
abstract
Most commercial database systems support B/sup +/-tree indexes using either: physical row identifiers, for example, DB2; or logical row identifiers, for example, NonStop SQL. Physical row identifiers provide fast access to data. However, unlike logical row identifiers, they need to be updated whenever the row moves. This paper describes an alternate approach where hybrid row identifiers are used. A hybrid row identifier consists of two components: a logical component, namely, the primary key of the base table row; and a physical component, namely, the database block address (DBA) of the row. By treating the DBA as a guess regarding where the row may be found, performance comparable to physical B/sup +/-tree indexes is attained for valid guess-DBAs. This scheme retains the logical index advantage of avoiding an immediate index update when the base table row moves. Instead, an online utility can be used to lazily fix the invalid guess-DBAs. This scheme has been used to implement B/sup +/-tree indexes for Oracle8i index-organized tables (primary B/sup +/-tree like structure) which encounter both row movement and table reorganization.
Eugene Inseok Chong, Souripriya Das, Chuck Freiwald, Jagannathan Srinivasan, Aravind Yalamanchi, Mahesh Jagannath, Anh-Tuan Tran 0005, Ramkumar Krishnan
ICDE8
2001 The Importance of Extensible Database Systems for E-Commerce
abstract
Over the last decade, database system products have been extended to provide support for defining, storing, updating, indexing and retrieving complex data with full transaction semantics. Oracle, IBM, Informix and others have used extensibility technology to build database system extensions for text, image, spatial, audio/video, chemical, genetic and other types of complex data. Currently, we find database systems being deployed in support of e-commerce. In many cases, these e-commerce database applications use only simple SQL data types to represent items such as office supplies, computers, books and CDs. There is also a large and important set of e-commerce applications that employ complex data formats such as EDI, SWIFT and HL7. The database extensibility features initially developed to support text, spatial and similar forms of complex data are now being used to build e-commerce applications. Thus, database extensibility technology is evolving into an important mechanism to enable the development of e-commerce systems.
Samuel DeFazio, Ramkumar Krishnan, Jagannathan Srinivasan, Saydean Zeldin
ICDE2
2000 Oracle8i Index-Organized Table and Its Application to New Domains
Jagannathan Srinivasan, Souripriya Das, Chuck Freiwald, Eugene Inseok Chong, Mahesh Jagannath, Aravind Yalamanchi, Ramkumar Krishnan, Anh-Tuan Tran 0005, Samuel DeFazio, Jayanta Banerjee
VLDB7