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

Danish Alsayed

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

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

Security and privacy · 1Databases, data management, data science and information retrieval · 1 · 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
1 paper
Data stream processing · 56% Query processing and optimization · 44%

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

TopicWeightPapersLastEvidence papers
Data stream processing
continuous query processing
0.512021
Cquirrel: Continuous Query Processing over Acyclic Relational Schemas · Proc. VLDB Endow. 2021
Query processing and optimization › join processing
multi-way join
0.512021
Cquirrel: Continuous Query Processing over Acyclic Relational Schemas · Proc. VLDB Endow. 2021
Data stream processing
stream processing systems
0.112021
Cquirrel: Continuous Query Processing over Acyclic Relational Schemas · Proc. VLDB Endow. 2021

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

fault tolerance · 0.5delta processing · 0.5
YearPublicationVenuePosition
2021 Cquirrel: Continuous Query Processing over Acyclic Relational Schemas
abstract
We will demonstrate Cquirrel, a continuous query processing engine built on top of Flink. Cquirrel assumes a relational schema where the foreign-key constraints form a directed acyclic graph, and supports any selection-projection-join-aggregation query where all join conditions are between a primary key and a foreign key. It allows arbitrary updates to any of the relations, and outputs the deltas in the query answers in real-time. It provides much better support for multi-way joins than the native join operator in Flink. Meanwhile, it offers better performance, scalability, and fault tolerance than other continuous query processing engines.
Qichen Wang 0001, Chaoqi Zhang 0006, Danish Alsayed, Ke Yi 0001, Bin Wu 0003, Feifei Li 0001, Chaoqun Zhan
Proc. VLDB Endow.3
2017 Kakute: A Precise, Unified Information Flow Analysis System for Big-data Security
abstract
Big-data frameworks (e.g., Spark) enable computations on tremendous data records generated by third parties, causing various security and reliability problems such as information leakage and programming bugs. Existing systems for big-data security (e.g., Titian) track data transformations in a record level, so they are imprecise and too coarse-grained for these problems. For instance, when we ran Titian to drill down input records that produced a buggy output record, Titian reported 3 to 9 orders of magnitude more input records than the actual ones. Information Flow Tracking (IFT) is a conventional approach for precise information control. However, extant IFT systems are neither efficient nor complete for big-data frameworks, because theses frameworks are data-intensive, and data flowing across hosts is often ignored by IFT.
Jianyu Jiang, Shixiong Zhao, Danish Alsayed, Heming Cui, Feng Liang 0004, Zhaoquan Gu
ACSAC3