• Publications
  • Influence
Principles of Distributed Database Systems
TLDR
This third edition of a classic textbook can be used to teach at the senior undergraduate and graduate levels and concentrates on fundamental theories as well as techniques and algorithms in distributed data management. Expand
Robust and fast similarity search for moving object trajectories
TLDR
Analysis and comparison of EDR with other popular distance functions, such as Euclidean distance, Dynamic Time Warping (DTW), Edit distance with Real Penalty (ERP), and Longest Common Subsequences, indicate that EDR is more robust than Euclideans distance, DTW and ERP, and it is on average 50% more accurate than LCSS. Expand
Diversified Stress Testing of RDF Data Management Systems
TLDR
This work performs an in-depth experimental analysis that shows existing SPARQL benchmarks are not suitable for testing systems for diverse queries and varied workloads and provides stress testing tools for RDF data management systems, and uses the Waterloo SParQL Diversity Test Suite (WatDiv) to address these shortcomings. Expand
Issues in data stream management
TLDR
The purpose of this paper is to review recent work in data stream management systems, with an emphasis on application requirements, data models, continuous query languages, and query evaluation. Expand
K-Automorphism: A General Framework For Privacy Preserving Network Publication
TLDR
This paper proposes k-automorphism to protect against multiple structural attacks and develops an algorithm (called KM) that ensures k-Automorphism and discusses an extension of KM to handle "dynamic" releases of the data. Expand
Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware
TLDR
Through the analysis, light is shed on how modern hardware affects the implementation of data operators and the fastest implementation of radix join to date is provided, reaching close to 200 million tuples per second. Expand
Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited
TLDR
The experiments show that, contrary to claims, radix-hash join is still clearly superior, and sort-merge approaches to performance of radix only when very large amounts of data are involved. Expand
Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor
TLDR
This paper studies a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs and comes up with an efficient algorithm called MaxOverlap, which is many times faster than the best-known technique. Expand
XBench benchmark and performance testing of XML DBMSs
TLDR
The XBench XML benchmark is discussed, a family of XML benchmarks which recognizes that the XML data that DBMSs manage are quite varied and no one database schema and workload can properly capture this variety. Expand
...
1
2
3
4
5
...