Ying Zhang

VLDB J., 2022

Computing K-Cores in Large Uncertain Graphs: An Index-Based Optimal Approach.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Stable Community Detection in Signed Social Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

Graph Neural Network for Fraud Detection via Spatial-Temporal Attention.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2022

A Synopsis Based Approach for Itemset Frequency Estimation over Massive Multi-Transaction Stream.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2022

Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Efficient Shortest Path Counting on Large Road Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Efficient processing of <i>k</i>-regret minimization queries with theoretical guarantees.

[BibT_eX]

[DOI]

Inf. Sci., 2022

Neural Subgraph Counting with Wasserstein Estimator.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

On Scalable Computation of Graph Eccentricities.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Reachability Labeling for Distributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

TMN: Trajectory Matching Networks for Predicting Similarity.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient Learning-based Community-Preserving Graph Generation.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Discovering Hierarchy of Bipartite Graphs with Cohesive Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Efficient Reinforcement of Bipartite Networks at Billion Scale.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Temporal and Heterogeneous Graph Neural Network for Financial Time Series Prediction.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021

Binarized graph neural network.

[BibT_eX]

[DOI]

World Wide Web, 2021

Efficient Hop-constrained s-t Simple Path Enumeration.

[BibT_eX]

[DOI]

VLDB J., 2021

EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search.

[BibT_eX]

[DOI]

VLDB J., 2021

Efficient and High-Quality Seeded Graph Matching: Employing Higher-order Structural Information.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2021

Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

On Querying Historical K-Cores.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Discovering fortress-like cohesive subgraphs.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2021

Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2021

Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs.

[BibT_eX]

[DOI]

Inf. Sci., 2021

Towards User Engagement Dynamics in Social Networks.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Processing of k-regret Minimization Queries with Theoretical Guarantees.

[BibT_eX]

[DOI]

CoRR, 2021

Interpretable Pneumonia Detection by Combining Deep Learning and Explainable Models With Multisource Data.

[BibT_eX]

[DOI]

IEEE Access, 2021

High-Dimensional Similarity Query Processing for Data Science.

[BibT_eX]

[DOI]

Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

T3S: Effective Representation Learning for Trajectory Similarity Computation.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient and Effective Community Search on Large-scale Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Efficient Community Search with Size Constraint.

[BibT_eX]

[DOI]

Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Pareto-optimal Community Search on Large Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

A Cohesive Structure Based Bipartite Graph Analytics System.

[BibT_eX]

[DOI]

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

DLQ: A System for Label-Constrained Reachability Queries on Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020

Correction: A survey of community search over big graphs.

[BibT_eX]

[DOI]

VLDB J., 2020

A survey of community search over big graphs.

[BibT_eX]

[DOI]

VLDB J., 2020

Finding Critical Users in Social Communities: The Collapsed Core and Truss Problems.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

ESPM: Efficient Spatial Pattern Matching.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Mitigating the Impact of Data Sampling on Social Media Analysis and Mining.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Soc. Syst., 2020

Similarity Query Processing for High-Dimensional Data.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Maximum Biclique Search at Billion Scale.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System.

[BibT_eX]

[DOI]

CoRR, 2020

Applying a Systematic Literature Review and Content Analysis Method to Analyse Open Source Developers' Forking Motivation Interpretation, Categories and Consequences.

[BibT_eX]

[DOI]

Bee Bee Chua

Australas. J. Inf. Syst., 2020

Hurricane in Bipartite Graphs: The Lethal Nodes of Butterflies.

[BibT_eX]

[DOI]

Proceedings of the SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management, 2020

Progressive Top-K Nearest Neighbors Search in Large Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

Global Reinforcement of Social Networks: The Anchored Coreness Problem.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

Scaling Up Distance Labeling on Graphs with Core-Periphery Properties.

[BibT_eX]

[DOI]

Proceedings of the 2020 International Conference on Management of Data, 2020

Knowledge Graph-based Event Embedding Framework for Financial Quantitative Investments.

[BibT_eX]

[DOI]

Proceedings of the 43rd International ACM SIGIR conference on research and development in Information Retrieval, 2020

GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Risk Guarantee Prediction in Networked-Loans.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Distributed Streaming Set Similarity Join.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficiently Answering Span-Reachability Queries in Large Temporal Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Efficient Bitruss Decomposition for Large-scale Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

I/O Efficient Approximate Nearest Neighbour Search based on Learned Functions.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Finding the Best k in Core Decomposition: A Time and Space Optimal Solution.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

ESPM: Efficient Spatial Pattern Matching (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

Discovering Cliques in Signed Networks Based on Balance Theory.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

I/O Efficient Algorithm for c-Approximate Furthest Neighbor Search in High-Dimensional Space.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2020

2019

Efficient community discovery with user engagement and similarity.

[BibT_eX]

[DOI]

VLDB J., 2019

Leveraging set relations in exact and dynamic set similarity join.

[BibT_eX]

[DOI]

VLDB J., 2019

Eccentricities on small-world networks.

[BibT_eX]

[DOI]

VLDB J., 2019

I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

Fully Dynamic Depth-First Search in Directed Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Efficient Progressive Minimum k-core Search.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Distributed Subgraph Matching on Timely Dataflow.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Cost optimization based on influence and user preference.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2019

Selectivity Estimation on Set Containment Search.

[BibT_eX]

[DOI]

Data Sci. Eng., 2019

VulnDS: Top-k Vulnerable SME Detection System in Networked-Loans.

[BibT_eX]

[DOI]

CoRR, 2019

A Survey and Experimental Analysis of Distributed Subgraph Matching.

[BibT_eX]

[DOI]

CoRR, 2019

Predicting open source programming language repository file survivability from forking data.

[BibT_eX]

[DOI]

Bee Bee Chua

Proceedings of the 15th International Symposium on Open Collaboration, 2019

Scaling Distance Labeling on Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the 2019 International Conference on Management of Data, 2019

Efficient Maximal Spatial Clique Enumeration.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Hierarchical Decomposition of Big Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Index-Based Optimal Algorithm for Computing K-Cores in Large Uncertain Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Enumerating k-Vertex Connected Components in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

I-LSH: I/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Accelerate MaxBRkNN Search by kNN Estimation.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

2018

Efficient set containment join.

[BibT_eX]

[DOI]

VLDB J., 2018

Online Product Quantization.

[BibT_eX]

[DOI]

Donna Xu

Ivor W. Tsang

IEEE Trans. Knowl. Data Eng., 2018

Real-time Constrained Cycle Detection in Large Dynamic Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

Voiceprint recognition of Parkinson patients based on deep learning.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information.

[BibT_eX]

[DOI]

CoRR, 2018

When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Conference on Management of Data, 2018

Efficiently Reinforcing Social Networks over User Engagement and Tie Strength.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Efficient Probabilistic K-Core Computation on Uncertain Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Exacting Eccentricity for Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Discovering Strong Communities with User Engagement and Tie Strength.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

Maximize Spatial Influence of Facility Bundle Considering Reverse k Nearest Neighbors.

[BibT_eX]

[DOI]

Shenlu Wang

Proceedings of the Database Systems for Advanced Applications, 2018

An Efficient Exact Nearest Neighbor Search by Compounded Embedding.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

Finding Maximal Stable Cores in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2018

Maintaining Boolean Top-K Spatial Temporal Results in Publish-Subscribe Systems.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2018

2017

Categorical top-k spatial influence query.

[BibT_eX]

[DOI]

World Wide Web, 2017

Reverse k nearest neighbors queries and spatial reverse top-k queries.

[BibT_eX]

[DOI]

Shiyu Yang

VLDB J., 2017

Top-k spatial-keyword publish/subscribe over sliding window.

[BibT_eX]

[DOI]

VLDB J., 2017

Bring Order into the Samples: A Novel Scalable Method for Influence Maximization.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

Efficient Distance-Aware Influence Maximization in Geo-Social Networks.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Efficient Structural Graph Clustering: An Index-Based Approach.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Leveraging Set Relations in Exact Set Similarity Join.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2017

Enumerating k-Vertex Connected Components in Large Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Matrix Sketching over Distributed Data.

[BibT_eX]

[DOI]

Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

A Fast Order-Based Approach for Core Maintenance.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

TT-Join: Efficient Set Containment Join.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Bring Order into the Samples: A Novel Scalable Method for Influence Maximization (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Protecting Location Privacy in Spatial Crowdsourcing using Encrypted Data.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Extending Database Technology, 2017

DSKQ: A System for Efficient Processing of Diversified Spatial-Keyword Query.

[BibT_eX]

[DOI]

Xiaoyang Wang

Proceedings of the Databases Theory and Applications, 2017

Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2016

Efficient Probabilistic Supergraph Search.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2016

Efficient Identification of Local Keyword Patterns in Microblogging Platforms.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2016

SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Scalable Distributed Subgraph Enumeration.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement (v1.0).

[BibT_eX]

[DOI]

CoRR, 2016

Influence based cost optimization on user preference.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

I/O efficient Core Graph Decomposition at web scale.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Distance-aware influence maximization in geo-social network.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

Efficiently computing reverse k furthest neighbors.

[BibT_eX]

[DOI]

Shenlu Wang

Dongxi Liu

Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016

SKPS: Towards Efficient Processing of Spatial-Keyword Publish/Subscribe System.

[BibT_eX]

[DOI]

Xiang Wang

Shiyu Yang

Proceedings of the Databases Theory and Applications, 2016

EDMS: A System for Efficient Processing Distance-Aware Influence Maximization.

[BibT_eX]

[DOI]

Xiaoyang Wang

Chen Chen

Proceedings of the Databases Theory and Applications, 2016

2015

Probabilistic n-of-N skyline computation over uncertain data streams.

[BibT_eX]

[DOI]

Aiping Li

Lijun Chang

World Wide Web, 2015

AP-Tree: efficiently support location-aware Publish/Subscribe.

[BibT_eX]

[DOI]

VLDB J., 2015

Finding Top k Most Influential Spatial Facilities over Uncertain Objects.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2015

Optimal Enumeration: Efficient Top-k Tree Matching.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates.

[BibT_eX]

[DOI]

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

Selecting Representative Objects Considering Coverage and Diversity.

[BibT_eX]

[DOI]

Shenlu Wang

Proceedings of the Second International ACM Workshop on Managing and Mining Enriched Geo-Spatial Data, 2015

AP-Tree: Efficiently support continuous spatial-keyword queries over stream.

[BibT_eX]

[DOI]

Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Spatial Keyword Range Search on Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2015

Range Search on Uncertain Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014

Efficient top-k similarity join processing over multi-valued objects.

[BibT_eX]

[DOI]

Liming Zhan

World Wide Web, 2014

Consensus-Based Ranking of Multivalued Objects: A Generalized Borda Count Approach.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2014

Effectively Indexing the Multidimensional Uncertain Objects.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2014

Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2014

SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2014

Matching dominance: capture the semantics of dominance for multi-dimensional uncertain objects.

[BibT_eX]

[DOI]

Chengqi Zhang

Proceedings of the Conference on Scientific and Statistical Database Management, 2014

Efficiently identify local frequent keyword co-occurrence patterns in geo-tagged Twitter stream.

[BibT_eX]

[DOI]

Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2014

SLICE: Reviving regions-based pruning for reverse k nearest neighbors queries.

[BibT_eX]

[DOI]

Shiyu Yang

Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

Diversified Spatial Keyword Search On Road Networks.

[BibT_eX]

[DOI]

Xiaoyang Wang

Proceedings of the 17th International Conference on Extending Database Technology, 2014

Identifying Top k Dominating Objects over Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2014

2013

Efficient general spatial skyline computation.

[BibT_eX]

[DOI]

World Wide Web, 2013

Probabilistic skyline operator over sliding windows.

[BibT_eX]

[DOI]

Inf. Syst., 2013

Probabilistic k-Skyband Operator over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the Web-Age Information Management - 14th International Conference, 2013

Skyline probability over uncertain preferences.

[BibT_eX]

[DOI]

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

A safe zone based approach for monitoring moving skyline queries.

[BibT_eX]

[DOI]

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

AVR-Tree: Speeding Up the NN and ANN Queries on Location Data.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2013

Probabilistic Top-k Dominating Query over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the Web Technologies and Applications - 15th Asia-Pacific Web Conference, 2013

2012

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks.

[BibT_eX]

[DOI]

VLDB J., 2012

Efficiently processing snapshot and continuous reverse k nearest neighbors queries.

[BibT_eX]

[DOI]

VLDB J., 2012

Stochastic skylines.

[BibT_eX]

[DOI]

Qing Zhang

ACM Trans. Database Syst., 2012

Efficient Computation of Range Aggregates against Uncertain Location-Based Queries.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2012

Skyline: Stacking Optimal Solutions in Exact and Uncertain Worlds.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2012

SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Effectively indexing the multi-dimensional uncertain objects for range searching.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Extending Database Technology, 2012

Top-k Similarity Join over Multi-valued Objects.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2012

General Spatial Skyline Operator.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2012

2011

Ranking uncertain sky: The probabilistic top-k skyline operator.

[BibT_eX]

[DOI]

Inf. Syst., 2011

Stochastic skyline operator.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Data Engineering, 2011

Influence zone: Efficiently processing reverse k nearest neighbors queries.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Data Engineering, 2011

BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2011

2010

Threshold-based probabilistic top-<i>k</i> dominating queries.

[BibT_eX]

[DOI]

VLDB J., 2010

Effectively Indexing the Uncertain Space.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2010

Duplicate-Insensitive Order Statistics Computation over Data Streams.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2010

Connected substructure similarity search.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Efficient rank based KNN query processing over uncertain data.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Data Engineering, 2010

Quantile-based KNN over multi-valued objects.

[BibT_eX]

[DOI]

Wei Wang

Proceedings of the 26th International Conference on Data Engineering, 2010

Similarity search on supergraph containment.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Data Engineering, 2010

NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2010

Counting distinct objects over sliding windows.

[BibT_eX]

[DOI]

Proceedings of the Database Technologies 2010, 2010

2009

Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2009

Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Data and Web Management, Joint International Conferences, 2009

Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets.

[BibT_eX]

[DOI]

Mahady Hasan

Proceedings of the Advances in Spatial and Temporal Databases, 2009

Probabilistic Skyline Operator over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

Uncertain Location Based Range Aggregates in a Multi-dimensional Space.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

2008

Computing order statistics over data streams.

[BibT_eX]

[DOI]

PhD thesis, 2008

Taming verification hardness: an efficient algorithm for testing subgraph isomorphism.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Managing Uncertain Data: Probabilistic Approaches.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Web-Age Information Management, 2008

Aggregate Computation over Data Streams.

[BibT_eX]

[DOI]