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

Asvin Ananthanarayan

dblp:28/4012 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 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
3 papers
Data integration and cleaning · 42% Query processing and optimization · 42% Data stream processing · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 100%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data explanation
0.512021
DIFF: a relational interface for large-scale data explanation · VLDB J. 2021
Data stream processing
complex event processing
0.112009
Microsoft CEP Server and Online Behavioral Targeting · Proc. VLDB Endow. 2009
Interconnection networks and networks-on-chip
high-speed networks
0.012002
Merging multiple data streams on common keys over high performance networks · SC 2002
Data stream processing
continuous query processing
0.012009
Microsoft CEP Server and Online Behavioral Targeting · Proc. VLDB Endow. 2009
YearPublicationVenuePosition
2021 DIFF: a relational interface for large-scale data explanation
Firas Abuzaid, Peter Kraft, Sahaana Suri, Edward Gan, Eric Xu, Atul Shenoy, Asvin Ananthanarayan, John Sheu, Erik Meijer 0001, Xi Wu 0001, Jeffrey F. Naughton, Peter Bailis, Matei Zaharia
VLDB J.7
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.10
2003 Data webs for earth science data
Asvin Ananthanarayan, Rajiv Balachandran, Robert L. Grossman, Yunhong Gu, Xinwei Hong, Jorge Levera, Marco Mazzucco
Parallel Comput.1
2002 Merging multiple data streams on common keys over high performance networks
abstract
The model for data mining on streaming data assumes that there is a buffer of fixed length and a data stream of infinite length and the challenge is to extract patterns, changes, anomalies, and statistically significant structures by examining the data one time and storing records and derived attributes of length less than N. As data grids, data webs, and semantic webs become more common, mining distributed streaming data will become more and more important. The first step when presented with two or more distributed streams is to merge them using a common key. In this paper, we present two algorithms for merging streaming data using a common key. We also present experimental studies showing these algorithms scale in practice to OC-12 networks.
Marco Mazzucco, Asvin Ananthanarayan, Robert L. Grossman, Jorge Levera, Gokulnath Bhagavantha Rao
SC2