• Publications
  • Influence
Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems
TLDR
A dynamic programming algorithm is presented to solve the three questions in sequential time $O(|T_1 | \times |T_2 |) . Expand
  • 1,226
  • 112
  • PDF
The dangers of replication and a solution
TLDR
A new two-tier replication algorithm is proposed that allows mobile (disconnected) applications to propose tentative update transactions that are later applied to a master copy. Expand
  • 1,282
  • 84
  • PDF
Secure Untrusted Data Repository (SUNDR)
TLDR
SUNDR is a network file system designed to store data securely on untrusted servers. Expand
  • 460
  • 51
  • PDF
StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time
TLDR
We compute multi-stream statistics such as synchronous as well as time-delayed correlation and vector inner-product in a continuous online fashion. Expand
  • 714
  • 47
  • PDF
Filtering algorithms and implementation for very fast publish/subscribe systems
TLDR
Publish/subscribe is the paradigm in which users express long-term interests (“subscriptions”) and some agent “publishes” events (e.g., offers). Expand
  • 608
  • 43
  • PDF
Making snapshot isolation serializable
TLDR
Snapshot Isolation (SI) is a multiversion concurrency control algorithm, first described in Berenson et al. Expand
  • 313
  • 40
  • PDF
Efficient and correct execution of parallel programs that share memory
TLDR
In this paper we consider an optimization problem that arises in the execution of parallel programs on shared-memory multiple-instruction-stream, multiple-data-stream (MIMD) computers. Expand
  • 376
  • 39
  • PDF
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
TLDR
In a path-breaking paper last year Pat and Betty O’Neil and Gerhard Weikum posed a self-tuning improvement to the Least Recently Used (LRU) buffer management algorithm[l5] and advocates giving priority to buffer pages baaed on the kth most recent access. Expand
  • 648
  • 31
  • PDF
On the Editing Distance Between Unordered Labeled Trees
TLDR
This paper considers the problem of computing the editing distance between unordered, labeled trees. Expand
  • 346
  • 29
  • PDF
Algorithmics and applications of tree and graph searching
TLDR
This paper surveys both algorithms and applications, giving some emphasis to our own work. Expand
  • 446
  • 28
  • PDF