VLDB 2026 Research / reviewers in the wild / expert
Jagrati Agrawal
dblp:60/1430
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2008
—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
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 |
Data stream processing · 87% Data models and query languages · 13% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data stream processing › complex event processing
event pattern matching |
0.2 | 2 | 2008 | Efficient pattern matching over event streams · SIGMOD Conference 2008 On Supporting Kleene Closure over Event Streams · ICDE 2008 |
Data stream processing
complex event processing |
0.1 | 1 | 2008 | On Supporting Kleene Closure over Event Streams · ICDE 2008 |
Data stream processing
continuous query processing |
0.1 | 1 | 2008 | Efficient pattern matching over event streams · SIGMOD Conference 2008 |
Data models and query languages › query language design
pattern language |
0.0 | 1 | 2008 | On Supporting Kleene Closure over Event Streams · ICDE 2008 |
Data models and query languages
query language |
0.0 | 1 | 2008 | On Supporting Kleene Closure over Event Streams · ICDE 2008 |
Methods — techniques the papers use, named apart from their topics
regular expression matching · 0.1expressive power analysis · 0.1automata-based implementation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | On Supporting Kleene Closure over Event StreamsabstractComplex event patterns involving Kleene closure are finding application in a variety of stream environments for tracking and monitoring purposes. In this paper, we propose a compact language, SASE+, that can be used to define a wide variety of Kleene closure patterns, analyze the expressive power of the language, and outline an automata-based implementation for efficient Kleene closure evaluation over event streams. Daniel Gyllstrom, Jagrati Agrawal, Yanlei Diao, Neil Immerman |
ICDE | 2 |
| 2008 | Efficient pattern matching over event streamsabstractPattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electronic health systems. While regular expression matching is well studied, pattern matching over streams presents two new challenges: Languages for pattern matching over streams are significantly richer than languages for regular expression matching. Furthermore, efficient evaluation of these pattern queries over streams requires new algorithms and optimizations: the conventional wisdom for stream query processing (i.e., using selection-join-aggregation) is inadequate. Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman |
SIGMOD Conference | 1 |