Yufei Tao

Orcid: 0000-0003-3883-5452

Affiliations:
  • Chinese University of Hong Kong


According to our database1, Yufei Tao authored at least 212 papers between 2001 and 2024.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2020, "For contributions to algorithms for large scale data processing".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation.
J. ACM, 2024

Subgraph Enumeration in Optimal I/O Complexity.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
Partial Order Multiway Search.
ACM Trans. Database Syst., December, 2023

Range updates and range sum queries on multidimensional points with monoid weights.
Comput. Geom., December, 2023

An Optimal Algorithm for Partial Order Multiway Search.
SIGMOD Rec., 2023

Indexing for Keyword Search with Structured Constraints.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Space-Query Tradeoffs in Range Subgraph Counting and Listing.
Proceedings of the 26th International Conference on Database Theory, 2023

Enumerating Subgraphs of Constant Sizes in External Memory.
Proceedings of the 26th International Conference on Database Theory, 2023

2022
On Finding Rank Regret Representatives.
ACM Trans. Database Syst., 2022

Generic Techniques for Building Top-<i>k</i> Structures.
ACM Trans. Algorithms, 2022

A Near-Optimal Parallel Algorithm for Joining Binary Relations.
Log. Methods Comput. Sci., 2022

Intersection joins under updates.
J. Comput. Syst. Sci., 2022

Algorithmic Techniques for Independent Query Sampling.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Optimal Algorithms for Multiway Search on Partial Orders.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Cross-Space Active Learning on Graph Convolutional Networks.
Proceedings of the International Conference on Machine Learning, 2022

Parallel Acyclic Joins with Canonical Edge Covers.
Proceedings of the 25th International Conference on Database Theory, 2022

2021
Technical Perspective of Efficient Directed Densest Subgraph Discovery.
SIGMOD Rec., 2021

Minimum Vertex Augmentation.
Proc. VLDB Endow., 2021

I/O-efficient 2-d orthogonal range skyline and attrition priority queues.
Comput. Geom., 2021

New Algorithms for Monotone Classification.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Two-Attribute Skew Free, Isolated CP Theorem, and Massively Parallel Joins.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting.
Proceedings of the 24th International Conference on Database Theory, 2021

2020
Packing R-trees with Space-filling Curves: Theoretical Optimality, Empirical Efficiency, and Bulk-loading Parallelizability.
ACM Trans. Database Syst., 2020

Advice from SIGMOD/PODS 2020.
SIGMOD Rec., 2020

Database Theory Column.
SIGACT News, 2020

Front Matter.
Proc. VLDB Endow., 2020

From Online to Non-i.i.d. Batch Learning.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

A Simple Parallel Algorithm for Natural Joins on Binary Relations.
Proceedings of the 23rd International Conference on Database Theory, 2020

2019
Output-Optimal Massively Parallel Algorithms for Similarity Joins.
ACM Trans. Database Syst., 2019

Entity Matching with Quality and Error Guarantees.
SIGMOD Rec., 2019

A Guide to Designing Top-k Indexes.
SIGMOD Rec., 2019

Building an Optimal Point-Location Structure in O( sort (n)) I/Os.
Algorithmica, 2019

Interactive Graph Search.
Proceedings of the 2019 International Conference on Management of Data, 2019

Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Spatiotemporal Data Warehouses.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Reverse Nearest Neighbor Query.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability.
Proc. VLDB Endow., 2018

An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications.
J. Graph Algorithms Appl., 2018

Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened.
Algorithmica, 2018

Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks.
Proceedings of the 2018 International Conference on Management of Data, 2018

Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space.
Proceedings of the 2018 International Conference on Management of Data, 2018

Overlap Set Similarity Joins with Theoretical Guarantees.
Proceedings of the 2018 International Conference on Management of Data, 2018

Entity Matching with Active Monotone Classification.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Massively Parallel Entity Matching with Linear Classification in Low Dimensional Space.
Proceedings of the 21st International Conference on Database Theory, 2018

2017
Indexing, BDual Tree.
Proceedings of the Encyclopedia of GIS., 2017

Queries in Spatiotemporal Databases, Time Parameterized.
Proceedings of the Encyclopedia of GIS., 2017

Nearest Neighbor Queries in Network Databases.
Proceedings of the Encyclopedia of GIS., 2017

Maximizing Range Sum in Spatial Databases.
Proceedings of the Encyclopedia of GIS., 2017

Stream sampling over windows with worst-case optimality and $$\ell $$ ℓ -overlap independence.
VLDB J., 2017

On the Hardness and Approximation of Euclidean DBSCAN.
ACM Trans. Database Syst., 2017

Dynamic Density Based Clustering.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Output-optimal Parallel Algorithms for Similarity Joins.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

2016
Exact and approximate flexible aggregate similarity search.
VLDB J., 2016

Guest Editorial: Special Section on the International Conference on Data Engineering.
IEEE Trans. Knowl. Data Eng., 2016

I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration.
J. Comput. Syst. Sci., 2016

Range Thresholding on Streams.
Proceedings of the 2016 International Conference on Management of Data, 2016

Efficient Top-k Indexing via General Reductions.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Top-k Indexes Made Small and Sweet (Invited Talk).
Proceedings of the 19th International Conference on Database Theory, 2016

2015
Independent Range Sampling on a RAM.
IEEE Data Eng. Bull., 2015

Distributed Online Tracking.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

On Top-k Range Reporting in 2D Space.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

External Memory Stream Sampling.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On The I/O Complexity of Dynamic Distinct Counting.
Proceedings of the 18th International Conference on Database Theory, 2015

2014
Instance-level worst-case query bounds on R-trees.
VLDB J., 2014

I/O-Efficient Algorithms on Triangle Listing and Counting.
ACM Trans. Database Syst., 2014

Maximizing Range Sum in External Memory.
ACM Trans. Database Syst., 2014

Range Aggregation With Set Selection.
IEEE Trans. Knowl. Data Eng., 2014

I/O-Efficient Bundled Range Aggregation.
IEEE Trans. Knowl. Data Eng., 2014

Fast Nearest Neighbor Search with Keywords.
IEEE Trans. Knowl. Data Eng., 2014

Dynamic Ray Stabbing.
ACM Trans. Algorithms, 2014

Shortest Unique Queries on Strings.
Proceedings of the String Processing and Information Retrieval, 2014

I/O-Efficient Dictionary Search with One Edit Error.
Proceedings of the String Processing and Information Retrieval, 2014

Finding approximate partitions and splitters in external memory.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Concurrent Range Reporting in Two-Dimensional Space.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A dynamic I/O-efficient structure for one-dimensional top-k range reporting.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Independent range sampling.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

2013
Clustering Uncertain Data Based on Probability Distribution Similarity.
IEEE Trans. Knowl. Data Eng., 2013

Approximate MaxRS in Spatial Databases.
Proc. VLDB Endow., 2013

Deep Web and MapReduce.
J. Comput. Sci. Eng., 2013

Guest editorial: spatial and temporal databases.
GeoInformatica, 2013

Output-sensitive Skyline Algorithms in External Memory.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Minimal MapReduce algorithms.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Optimal splitters for temporal and multi-version databases.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Massive graph triangulation.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

I/O-efficient planar range skyline and attrition priority queues.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

2012
Exact and approximate algorithms for the most connected vertex problem.
ACM Trans. Database Syst., 2012

Worst-Case I/O-Efficient Skyline Algorithms.
ACM Trans. Database Syst., 2012

Efficient Computation of Range Aggregates against Uncertain Location-Based Queries.
IEEE Trans. Knowl. Data Eng., 2012

Optimal Algorithms for Crawling a Hidden Database in the Web.
Proc. VLDB Endow., 2012

A Scalable Algorithm for Maximizing Range Sum in Spatial Databases.
Proc. VLDB Endow., 2012

On Top-k Search and Range Reporting
CoRR, 2012

Theoretical results on keyword search and related problems.
Proceedings of the Third International Workshop on Keyword Search on Structured Data, 2012

Indexability of 2D range search revisited: constant redundancy and weak indivisibility.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Dynamic top-k range reporting in external memory.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Stabbing horizontal segments with vertical rays.
Proceedings of the 28th ACM Symposium on Computational Geometry, 2012

Beyond Heuristics: I/O-oriented Algorithms and Structures with Performance Guarantees.
Proceedings of the Twenty-Third Australasian Database Conference, 2012

2011
Anonymous Publication of Sensitive Transactional Data.
IEEE Trans. Knowl. Data Eng., 2011

On k-skip shortest paths.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Nearest keyword search in XML documents.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

New results on two-dimensional orthogonal range aggregation in external memory.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

On finding skylines in external memory.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

FIFO indexes for decomposable problems.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

2010
Transparent anonymization: Thwarting adversaries who know the algorithm.
ACM Trans. Database Syst., 2010

Efficient and accurate nearest neighbor and closest pair search in high-dimensional space.
ACM Trans. Database Syst., 2010

Superseding Nearest Neighbor Search on Uncertain Spatial Databases.
IEEE Trans. Knowl. Data Eng., 2010

The chair's report on SIGMOD'10 demonstration program.
SIGMOD Rec., 2010

Logging every footstep: quantile summaries for the entire history.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Finding maximum degrees in hidden bipartite graphs.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Correlation hiding by independence masking.
Proceedings of the 26th International Conference on Data Engineering, 2010

The hardness and approximation algorithms for l-diversity.
Proceedings of the EDBT 2010, 2010

2009
Spatio-Temporal Data Warehouses.
Proceedings of the Encyclopedia of Database Systems, 2009

Reverse Nearest Neighbor Query.
Proceedings of the Encyclopedia of Database Systems, 2009

Distributed Skyline Retrieval with Low Bandwidth Consumption.
IEEE Trans. Knowl. Data Eng., 2009

Efficient Evaluation of Probabilistic Advanced Spatial Queries on Existentially Uncertain Data.
IEEE Trans. Knowl. Data Eng., 2009

ANGEL: Enhancing the Utility of Generalization for Privacy Preserving Publication.
IEEE Trans. Knowl. Data Eng., 2009

Cost-Based Predictive Spatiotemporal Join.
IEEE Trans. Knowl. Data Eng., 2009

Optimal Random Perturbation at Multiple Privacy Levels.
Proc. VLDB Endow., 2009

Diversity in Skylines.
IEEE Data Eng. Bull., 2009

Quality and efficiency in high dimensional nearest neighbor search.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Indexing uncertain data.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Uncertain Location Based Range Aggregates in a Multi-dimensional Space.
Proceedings of the 25th International Conference on Data Engineering, 2009

Distance-Based Representative Skyline.
Proceedings of the 25th International Conference on Data Engineering, 2009

Scalable Keyword Search on Large Data Streams.
Proceedings of the 25th International Conference on Data Engineering, 2009

Querying Communities in Relational Databases.
Proceedings of the 25th International Conference on Data Engineering, 2009

Privacy Preserving Publishing on Multiple Quasi-identifiers.
Proceedings of the 25th International Conference on Data Engineering, 2009

Continuous privacy preserving publishing of data streams.
Proceedings of the EDBT 2009, 2009

Finding the influence set through skylines.
Proceedings of the EDBT 2009, 2009

Finding frequent co-occurring terms in relational keyword search.
Proceedings of the EDBT 2009, 2009

2008
Personalized Privacy Preservation.
Proceedings of the Privacy-Preserving Data Mining - Models and Algorithms, 2008

Indexing, BDual Tree.
Proceedings of the Encyclopedia of GIS., 2008

Queries in Spatio-temporal Databases, Time Parameterized.
Proceedings of the Encyclopedia of GIS., 2008

Nearest Neighbor Queries in Network Databases.
Proceedings of the Encyclopedia of GIS., 2008

Privacy Preserving Publication: Anonymization Frameworks and Principles.
Proceedings of the Handbook of Database Security - Applications and Trends, 2008

The <i>B</i><sup><i>dual</i></sup>-Tree: indexing moving objects by space filling curves in the dual space.
VLDB J., 2008

Efficient temporal counting with bounded error.
VLDB J., 2008

Primal or dual: which promises faster spatiotemporal search?
VLDB J., 2008

Output perturbation with query relaxation.
Proc. VLDB Endow., 2008

Dynamic anonymization: accurate statistical analysis with privacy preservation.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Query answering techniques on uncertain and probabilistic data: tutorial summary.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Preservation of proximity privacy in publishing numerical sensitive data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

On Skylining with Flexible Dominance Relation.
Proceedings of the 24th International Conference on Data Engineering, 2008

On Anti-Corruption Privacy Preserving Publication.
Proceedings of the 24th International Conference on Data Engineering, 2008

On the Anonymization of Sparse High-Dimensional Data.
Proceedings of the 24th International Conference on Data Engineering, 2008

2007
Multidimensional reverse <i>k</i> NN search.
VLDB J., 2007

Range search on multidimensional uncertain data.
ACM Trans. Database Syst., 2007

Efficient Skyline and Top-k Retrieval in Subspaces.
IEEE Trans. Knowl. Data Eng., 2007

Random Sampling for Continuous Streams with Arbitrary Updates.
IEEE Trans. Knowl. Data Eng., 2007

Branch-and-bound processing of ranked queries.
Inf. Syst., 2007

Efficient top-k processing in large-scaled distributed environments.
Data Knowl. Eng., 2007

On Efficient Spatial Matching.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Continuous Constraint Query Evaluation for Spatiotemporal Streams.
Proceedings of the Advances in Spatial and Temporal Databases, 2007

M-invariance: towards privacy preserving re-publication of dynamic datasets.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2007

On Multidimensional k-Anonymity with Local Recoding Generalization.
Proceedings of the 23rd International Conference on Data Engineering, 2007

2006
Towards multidimensional subspace skyline analysis.
ACM Trans. Database Syst., 2006

Reverse Nearest Neighbors in Large Graphs.
IEEE Trans. Knowl. Data Eng., 2006

Reverse Nearest Neighbor Search in Metric Spaces.
IEEE Trans. Knowl. Data Eng., 2006

Maintaining Sliding Window Skylines on Data Streams.
IEEE Trans. Knowl. Data Eng., 2006

Spatio-temporal join selectivity.
Inf. Syst., 2006

Spatial Query Estimation without the Local Uniformity Assumption.
GeoInformatica, 2006

Progressive Computation of the Min-Dist Optimal-Location Query.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

Anatomy: Simple and Effective Privacy Preservation.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

Personalized privacy preservation.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2006

Mining distance-based outliers from large databases in any metric space.
Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006

SUBSKY: Efficient Computation of Skylines in Subspaces.
Proceedings of the 22nd International Conference on Data Engineering, 2006

Processing Ranked Queries with the Minimum Space.
Proceedings of the Foundations of Information and Knowledge Systems, 2006

Efficient Quantile Retrieval on Multi-dimensional Data.
Proceedings of the Advances in Database Technology, 2006

Privacy Preserving Data Publication: From Generalization to Anatomy.
Proceedings of the 13th International Conference on Management of Data, 2006

2005
Historical spatio-temporal aggregation.
ACM Trans. Inf. Syst., 2005

Aggregate nearest neighbor queries in spatial databases.
ACM Trans. Database Syst., 2005

Progressive skyline computation in database systems.
ACM Trans. Database Syst., 2005

A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors.
IEEE Trans. Knowl. Data Eng., 2005

Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces.
Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Probabilistic Spatial Queries on Existentially Uncertain Data.
Proceedings of the Advances in Spatial and Temporal Databases, 9th International Symposium, 2005

RPJ: Producing Fast Join Results on Streams through Rate-based Optimization.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2005

Venn Sampling: A Novel Prediction Technique for Moving Objects.
Proceedings of the 21st International Conference on Data Engineering, 2005

2004
An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces.
IEEE Trans. Knowl. Data Eng., 2004

Range Aggregate Processing in Spatial Databases.
IEEE Trans. Knowl. Data Eng., 2004

Performance Analysis of R*-Trees with Arbitrary Node Extents .
IEEE Trans. Knowl. Data Eng., 2004

Reverse kNN Search in Arbitrary Dimensionality.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

All-Nearest-Neighbors Queries in Spatial Databases.
Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

Prediction and Indexing of Moving Objects with Unknown Motion Patterns.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

Mining, indexing, and querying historical spatiotemporal data.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

Approximate Temporal Aggregation.
Proceedings of the 20th International Conference on Data Engineering, 2004

Spatio-Temporal Aggregation Using Sketches.
Proceedings of the 20th International Conference on Data Engineering, 2004

Querying about the Past, the Present, and the Future in Spatio-Temporal.
Proceedings of the 20th International Conference on Data Engineering, 2004

Group Nearest Neighbor Queries.
Proceedings of the 20th International Conference on Data Engineering, 2004

2003
Analysis of predictive spatio-temporal queries.
ACM Trans. Database Syst., 2003

Spatial queries in dynamic environments.
ACM Trans. Database Syst., 2003

Recent Progress on Selected Topics in Database Research - A Report by Nine Young Chinese Researchers Working in the United States.
J. Comput. Sci. Technol., 2003

Query Processing in Spatial Network Databases.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries.
Proceedings of 29th International Conference on Very Large Data Bases, 2003

Validity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds.
Proceedings of the Advances in Spatial and Temporal Databases, 8th International Symposium, 2003

Location-based Spatial Queries.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

An Optimal and Progressive Algorithm for Skyline Queries.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

Selectivity Estimation for Predictive Spatio-Temporal Queries.
Proceedings of the 19th International Conference on Data Engineering, 2003

The power-method: a comprehensive estimation technique for multi-dimensional queries.
Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Management, 2003

2002
Cost models for overlapping and multiversion structures.
ACM Trans. Database Syst., 2002

Indexing and Retrieval of Historical Aggregate Information about Moving Objects.
IEEE Data Eng. Bull., 2002

Continuous Nearest Neighbor Search.
Proceedings of 28th International Conference on Very Large Data Bases, 2002

Adaptive Index Structures.
Proceedings of 28th International Conference on Very Large Data Bases, 2002

Time-parameterized queries in spatio-temporal databases.
Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, 2002

Cost Models for Overlapping and Multi-Version B-Trees.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

Indexing Spatio-Temporal Data Warehouses.
Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26, 2002

Aggregate Processing of Planar Points.
Proceedings of the Advances in Database Technology, 2002

2001
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries.
Proceedings of the VLDB 2001, 2001

Efficient Historical R-trees.
Proceedings of the 13th International Conference on Scientific and Statistical Database Management, 2001

Efficient OLAP Operations in Spatial Data Warehouses.
Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001


  Loading...