Xuemin Lin

IEEE Trans. Knowl. Data Eng., December, 2023

Clique Identification in Signed Graphs: A Balance Theory Based Model.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., December, 2023

High-Ratio Compression for Machine-Generated Data.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, December, 2023

When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks.

[BibT_eX]

[DOI]

VLDB J., November, 2023

Cohesive Subgraph Discovery Over Uncertain Bipartite Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2023

Balanced Clique Computation in Signed Networks: Concepts and Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., November, 2023

Core maintenance for hypergraph streams.

[BibT_eX]

[DOI]

World Wide Web (WWW), September, 2023

(p,q)-biclique counting and enumeration for large sparse bipartite graphs.

[BibT_eX]

[DOI]

VLDB J., September, 2023

Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks.

[BibT_eX]

[DOI]

Data Sci. Eng., September, 2023

Finding the Maximum $k$-Balanced Biclique on Weighted Bipartite Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., August, 2023

Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., August, 2023

Task Variance Regularized Multi-Task Learning.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., August, 2023

Computing Significant Cliques in Large Labeled Networks.

[BibT_eX]

[DOI]

IEEE Trans. Big Data, June, 2023

Toward maintenance of hypercores in large-scale dynamic hypergraphs.

[BibT_eX]

[DOI]

VLDB J., May, 2023

Class-aware tiny object recognition over large-scale 3D point clouds.

[BibT_eX]

[DOI]

Neurocomputing, April, 2023

Accelerated butterfly counting with vertex priority on bipartite graphs.

[BibT_eX]

[DOI]

VLDB J., March, 2023

Fast subgraph query processing and subgraph matching via static and dynamic equivalences.

[BibT_eX]

[DOI]

VLDB J., March, 2023

Efficiently Cleaning Structured Event Logs: A Graph Repair Approach.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., March, 2023

Efficient m-closest entity matching over heterogeneous information networks.

[BibT_eX]

[DOI]

Knowl. Based Syst., March, 2023

Utility-aware Payment Channel Network Rebalance.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Efficient Non-Learning Similar Subtrajectory Search.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2023

Scaling Up k-Clique Densest Subgraph Detection.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Towards Generating Hop-constrained s-t Simple Path Graphs.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

A Summary of ICDE 2022 Research Session Panels.

[BibT_eX]

[DOI]

Eleni Tzirita Zacharatou

Sibo Wang

Xiao Wang

Xue Wang

Raymond Chi-Wing Wong

IEEE Data Eng. Bull., 2023

Influence Minimization via Blocking Strategies.

[BibT_eX]

[DOI]

CoRR, 2023

GPUSCAN++: Eficient Structural Graph Clustering on GPUs.

[BibT_eX]

[DOI]

CoRR, 2023

Unleashing the Potential of Unsupervised Deep Outlier Detection through Automated Training Stopping.

[BibT_eX]

[DOI]

CoRR, 2023

Quantifying Node Importance over Network Structural Stability.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

A Holistic Approach for Answering Logical Queries on Knowledge Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Towards Efficient Shortest Path Counting on Billion-Scale Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficient Maximum Signed Biclique Identification.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Towards Higher-order Topological Consistency for Unsupervised Network Alignment.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Finer-Grained Engagement in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Flash: A Framework for Programming Distributed Graph Processing Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Dynamic Private Task Assignment under Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Index-Based Biclique Percolation Communities Search on Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Minimizing the Influence of Misinformation via Vertex Blocking.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

Efficient and Scalable Distributed Graph Structural Clustering at Billion Scale.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2023

Contraction Hierarchies with Label Restrictions Maintenance in Dynamic Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2023

2022

Critical Nodes Identification in Large Networks: The Inclined and Detached Models.

[BibT_eX]

[DOI]

World Wide Web, 2022

General graph generators: experiments, analyses, and improvements.

[BibT_eX]

[DOI]

VLDB J., 2022

Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs.

[BibT_eX]

[DOI]

VLDB J., 2022

Answering reachability and K-reach queries on large graphs with label constraints.

[BibT_eX]

[DOI]

VLDB J., 2022

Maximum and top-k diversified biclique search at scale.

[BibT_eX]

[DOI]

VLDB J., 2022

Anchored coreness: efficient reinforcement of social networks.

[BibT_eX]

[DOI]

VLDB J., 2022

Distance labeling: on parallelism, compression, and ordering.

[BibT_eX]

[DOI]

VLDB J., 2022

Continuous monitoring of moving skyline and top-k queries.

[BibT_eX]

[DOI]

Arif Hidayat

VLDB J., 2022

ABLE: Meta-Path Prediction in Heterogeneous Information Networks.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2022

Are we really making much progress in unsupervised graph outlier detection? Revisiting the problem with new insight and superior method.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient k-clique Listing with Set Intersection Speedup [Technical Report].

[BibT_eX]

[DOI]

CoRR, 2022

GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models [Technical Report].

[BibT_eX]

[DOI]

CoRR, 2022

Complex Question Answering Over Temporal Knowledge Graphs.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2022, 2022

Hop-Constrained s-t Simple Path Enumeration in Billion-Scale Labelled Graphs.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2022, 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

Crowdsourced Fact Validation for Knowledge Bases.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 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

Efficient $k-\text{clique}$ Listing with Set Intersection Speedup.

[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

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 Personalized Maximum Biclique Search.

[BibT_eX]

[DOI]

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

Reachability-Driven Influence Maximization in Time-dependent Road-social Networks.

[BibT_eX]

[DOI]

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

Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs.

[BibT_eX]

[DOI]

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

Index-based Structural Clustering on Directed Graphs.

[BibT_eX]

[DOI]

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

GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models.

[BibT_eX]

[DOI]

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

Estimating Node Importance Values in Heterogeneous Information Networks.

[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

Constrained Path Search with Submodular Function Maximization.

[BibT_eX]

[DOI]

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

Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks.

[BibT_eX]

[DOI]

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

MetaWeighting: Learning to Weight Tasks in Multi-Task Learning.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics: ACL 2022, 2022

Cohesive Subgraph Search Over Large Heterogeneous Information Networks

[BibT_eX]

[DOI]

Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-97567-8, 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 structural node similarity computation on billion-scale graphs.

[BibT_eX]

[DOI]

VLDB J., 2021

Reinforcement Learning-based Collective Entity Alignment with Adaptive Features.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2021

On Directed Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Chenhao Ma

ACM Trans. Database Syst., 2021

Generalizing the Pigeonhole Principle for Similarity Search in Hamming Space.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2021

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

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2021

Efficient Directed Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Chenhao Ma

SIGMOD Rec., 2021

On Querying Historical K-Cores.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Efficient Bi-triangle Counting for Large Bipartite Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Front Matter.

[BibT_eX]

[DOI]

Fatma Ozcan

Juliana Freire

Proc. VLDB Endow., 2021

Hierarchical Core Maintenance on Large Dynamic Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Front Matter.

[BibT_eX]

[DOI]

Juliana Freire

Proc. VLDB Endow., 2021

Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

Knowledge Graph Question Answering with semantic oriented fusion model.

[BibT_eX]

[DOI]

Knowl. Based Syst., 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

A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing [technical report].

[BibT_eX]

[DOI]

CoRR, 2021

Higher-Order Neighborhood Truss Decomposition.

[BibT_eX]

[DOI]

CoRR, 2021

SQL2Cypher: Automated Data and Query Migration from RDBMS to GDBMS.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2021, 2021

Critical Nodes Identification in Large Networks: An Inclination-Based Model.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2021, 2021

HUGE: An Efficient and Scalable Subgraph Enumeration System.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

When the Recursive Diversity Anonymity Meets the Ring Signature.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

IndoorViz: A Demonstration System for Indoor Spatial Data Management.

[BibT_eX]

[DOI]

Yue Li

Zhou Shao

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '21: International Conference on Management of Data, 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

Crowdrebate: An Effective Platform to Get more Rebate for Customers.

[BibT_eX]

[DOI]

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

Hypercore Maintenance in Dynamic Hypergraphs.

[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

PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA.

[BibT_eX]

[DOI]

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

FAST: FPGA-based Subgraph Matching on Massive Graphs.

[BibT_eX]

[DOI]

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

A Framework to Quantify Approximate Simulation on Graph Data.

[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

Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server.

[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

SQKT: A Student Attention-Based and Question-Aware Model for Knowledge Tracing.

[BibT_eX]

[DOI]

Proceedings of the Web and Big Data - 5th International Joint Conference, 2021

Co-authorship Prediction Based on Temporal Graph Attention.

[BibT_eX]

[DOI]

Proceedings of the Web and Big Data - 5th International Joint Conference, 2021

BanditMTL: Bandit-based Multi-task Learning for Text Classification.

[BibT_eX]

[DOI]

Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, 2021

2020

Efficient (α, β)-core computation in bipartite graphs.

[BibT_eX]

[DOI]

VLDB J., 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

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

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2020

Demand-Aware Route Planning for Shared Mobility Services.

[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

IDAR: Fast Supergraph Search Using DAG Integration.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Effective and Efficient Community Search over Large Heterogeneous Information Networks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Fair Task Assignment in Spatial Crowdsourcing.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

On spatial keyword covering.

[BibT_eX]

[DOI]

Dong-Wan Choi

Knowl. Inf. Syst., 2020

Taming the Expressiveness and Programmability of Graph Analytical Queries.

[BibT_eX]

[DOI]

CoRR, 2020

CoinMagic: A Differential Privacy Framework for Ring Signature Schemes.

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Efficient Maximal Balanced Clique Enumeration in Signed Networks.

[BibT_eX]

[DOI]

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 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

Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs.

[BibT_eX]

[DOI]

Chenhao Ma

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

An Empirical Study on Recent Graph Database Systems.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, Engineering and Management, 2020

A Dynamic Answering Path Based Fusion Model for KGQA.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, Engineering and Management, 2020

Online Programming Education Modeling and Knowledge Tracing.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, Engineering and Management, 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

Adaptive Adversarial Multi-task Representation Learning.

[BibT_eX]

[DOI]

Yuren Mao

Weiwei Liu

Proceedings of the 37th International Conference on Machine Learning, 2020

Collective Entity Alignment via Adaptive Features.

[BibT_eX]

[DOI]

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

Distributed Streaming Set Similarity Join.

[BibT_eX]

[DOI]

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

Effective and Efficient Truss Computation over Large Heterogeneous Information Networks.

[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

Task Allocation in Dependency-aware Spatial Crowdsourcing.

[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

MC-Explorer: Analyzing and Visualizing Motif-Cliques on Large Networks.

[BibT_eX]

[DOI]

Kevin Chen-Chuan Chang

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

StructSim: Querying Structural Node Similarity at Billion Scale.

[BibT_eX]

[DOI]

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

Speeding Up GED Verification for Graph Similarity Search.

[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

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

SimRank*: effective and scalable pairwise similarity search based on graph topology.

[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

Supergraph Search in Graph Databases via Hierarchical Feature-Tree.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

Efficient Mining of Frequent Patterns on Uncertain Graphs.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2019

Hyperspectral Imagery Classification via Stochastic HHSVMs.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 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

Efficient Algorithms for Densest Subgraph Discovery.

[BibT_eX]

[DOI]

Kaiqiang Yu

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

Collective Embedding-based Entity Alignment via Adaptive Features.

[BibT_eX]

[DOI]

CoRR, 2019

Critical Edge Identification: A K-Truss Based Model.

[BibT_eX]

[DOI]

CoRR, 2019

K-Core Maximization through Edge Additions.

[BibT_eX]

[DOI]

CoRR, 2019

A Survey and Experimental Analysis of Distributed Subgraph Matching.

[BibT_eX]

[DOI]

CoRR, 2019

Efficient (a,β)-core Computation: an Index-based Approach.

[BibT_eX]

[DOI]

Proceedings of the World Wide Web Conference, 2019

CoreCube: Core Decomposition in Multilayer Graphs.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

Scaling Distance Labeling on Small-World Networks.

[BibT_eX]

[DOI]

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

Pivotal Relationship Identification: The K-Truss Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

K-Core Maximization: An Edge Addition Approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Towards Efficient k-TriPeak Decomposition on Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 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

PatMat: A Distributed Pattern Matching Engine with Cypher.

[BibT_eX]

[DOI]

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

2018

Data Sketch/Synopsis.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Efficient structure similarity searches: a partition-based approach.

[BibT_eX]

[DOI]

VLDB J., 2018

Dynamical SimRank search on time-varying networks.

[BibT_eX]

[DOI]

VLDB J., 2018

Efficient set containment join.

[BibT_eX]

[DOI]

VLDB J., 2018

Multiview Spectral Clustering via Structured Low-Rank Matrix Factorization.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks Learn. Syst., 2018

Real-time Constrained Cycle Detection in Large Dynamic Graphs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

An Optimal and Progressive Approach to Online Search of Top-K Influential Communities.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2018

Introduction to the special issue on Data Science in Asia (with PAKDD'2017).

[BibT_eX]

[DOI]

Longbing Cao

Jae-Gil Lee

Int. J. Data Sci. Anal., 2018

Distributed computing connected components with linear communication cost.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 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 Computing of Radius-Bounded k-Cores.

[BibT_eX]

[DOI]

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

GPH: Similarity Search in Hamming Space.

[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]

Proceedings of the Database Systems for Advanced Applications, 2018

External Topological Sorting in Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

Towards Efficient Path Skyline Computation in Bicriteria Networks.

[BibT_eX]

[DOI]

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

PrivTS: Differentially Private Frequent Time-Constrained Sequential Pattern Mining.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2018

K-core Minimization: An Edge Manipulation Approach.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 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

Doubly Approximate Nearest Neighbor Classification.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 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]

VLDB J., 2017

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

[BibT_eX]

[DOI]

VLDB J., 2017

Scalable subgraph enumeration in MapReduce: a cost-oriented approach.

[BibT_eX]

[DOI]

VLDB J., 2017

Unsupervised Metric Fusion Over Multiview Data by Graph Random Walk-Based Cross-View Diffusion.

[BibT_eX]

[DOI]

IEEE Trans. Neural Networks Learn. Syst., 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

Editorial.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

A Novel and Fast SimRank Algorithm.

[BibT_eX]

[DOI]

Juan Lu

Zhiguo Gong

IEEE Trans. Knowl. Data Eng., 2017

New EIC Editorial.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

GALLOP: GlobAL Feature Fused LOcation Prediction for Different Check-in Scenarios.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2017

Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 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

Effective and Efficient Dynamic Graph Coloring.

[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

Special Issue on Graph Processing: Techniques and Applications.

[BibT_eX]

[DOI]

Jeffrey Xu Yu

Data Sci. Eng., 2017

An Optimal and Progressive Approach to Online Search of Top-k Important Communities.

[BibT_eX]

[DOI]

CoRR, 2017

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation.

[BibT_eX]

[DOI]

CoRR, 2017

Enumerating k-Vertex Connected Components in Large Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Distributed Algorithms on Exact Personalized PageRank.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM International Conference on Management of Data, 2017

SPOT: Selecting occuPations frOm Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 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

Tracking Matrix Approximation over Distributed Sliding Windows.

[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

Scalable Top-K Structural Diversity Search.

[BibT_eX]

[DOI]

Proceedings of the 33rd IEEE International Conference on Data Engineering, 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

Real-Time Popularity Prediction on Instagram.

[BibT_eX]

[DOI]

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

Answering subgraph queries over massive disk resident graphs.

[BibT_eX]

[DOI]

World Wide Web, 2016

Diversified top-k clique search.

[BibT_eX]

[DOI]

VLDB J., 2016

BEVA: An Efficient Query Processing Algorithm for Error-Tolerant Autocompletion.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 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

Understanding Short Texts through Semantic Enrichment and Hashing.

[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

Efficient Recovery of Missing Events.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2016

I/O Efficient ECC Graph Decomposition via Graph Reduction.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 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

Shifting multi-hypergraphs via collaborative probabilistic voting.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

Speedup Graph Processing by Graph Ordering.

[BibT_eX]

[DOI]

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

Efficient Subgraph Matching by Postponing Cartesian Products.

[BibT_eX]

[DOI]

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

Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Iterative Views Agreement: An Iterative Low-Rank Based Structured Optimization Method to Multi-View Spectral Clustering.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 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]

Dongxi Liu

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

Scalable supergraph search in large graph databases.

[BibT_eX]

[DOI]

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

Computing Connected Components with linear communication cost in pregel-like systems.

[BibT_eX]

[DOI]

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

Finding the minimum spatial keyword cover.

[BibT_eX]

[DOI]

Dong-Wan Choi

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

pSCAN: Fast and exact structural graph clustering.

[BibT_eX]

[DOI]

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

2015

Guest editorial: web information technologies.

[BibT_eX]

[DOI]

Jeffrey Xu Yu

World Wide Web, 2015

I/O efficient: computing SCCs in massive graphs.

[BibT_eX]

[DOI]

VLDB J., 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

Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2015

Robust Subspace Clustering for Multi-View Data by Exploiting Correlation Consensus.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2015

Reverse k Nearest Neighbors Query Processing: Experiments and Analysis.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Scalable Subgraph Enumeration in MapReduce.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Optimal Enumeration: Efficient Top-k Tree Matching.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2015

Impact Set: Computing Influence Using Query Logs.

[BibT_eX]

[DOI]

Comput. J., 2015

Efficiently Monitoring Reverse k-Nearest Neighbors in Spatial Networks.

[BibT_eX]

[DOI]

Comput. J., 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]

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

Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity.

[BibT_eX]

[DOI]

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

LBMCH: Learning Bridging Mapping for Cross-modal Hashing.

[BibT_eX]

[DOI]

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

Effective Multi-Query Expansions: Robust Landmark Retrieval.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Conference on Multimedia Conference, MM '15, Brisbane, Australia, October 26, 2015

Learning Term Embeddings for Hypernymy Identification.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Towards Frequent Subgraph Mining on Single Large Uncertain Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Data Mining, 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

Cleaning structured event logs: A graph repair approach.

[BibT_eX]

[DOI]

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

Efficiently Computing Top-K Shortest Path Join.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Extending Database Technology, 2015

Spatial Keyword Range Search on Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2015

Efficient String Similarity Search: A Cross Pivotal Based Approach.

[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

A Generic Framework for Top-k Pairs and Top-k Objects Queries over Sliding Windows.

[BibT_eX]

[DOI]

Haixun Wang

IEEE Trans. Knowl. Data Eng., 2014

Searching Dimension Incomplete Databases.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2014

A Unified Framework for Answering k Closest Pairs Queries and Variants.

[BibT_eX]

[DOI]

Haixun Wang

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

Scalable big graph processing in MapReduce.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 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

An Iterative Fusion Approach to Graph-Based Semi-Supervised Learning from Multiple Views.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2014

Shifting Hypergraphs by Probabilistic Voting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2014

Exploiting Correlation Consensus: Towards Subspace Clustering for Multi-modal Data.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Multimedia, MM '14, Orlando, FL, USA, November 03, 2014

Fast incremental SimRank on link-evolving graphs.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

A Unified Framework for Efficiently Processing Ranking Related Queries.

[BibT_eX]

[DOI]

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

Improving Performance of Graph Similarity Joins Using Selected Substructures.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2014

Identifying Top k Dominating Objects over Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2014

Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time.

[BibT_eX]

[DOI]

Proceedings of the Databases Theory and Applications, 2014

2013

Efficient general spatial skyline computation.

[BibT_eX]

[DOI]

World Wide Web, 2013

High efficiency and quality: large graphs matching.

[BibT_eX]

[DOI]

VLDB J., 2013

Efficient processing of graph similarity queries with edit distance constraints.

[BibT_eX]

[DOI]

VLDB J., 2013

Asymmetric signature schemes for efficient exact edit similarity query processing.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2013

VChunkJoin: An Efficient Algorithm for Edit Similarity Joins.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2013

Clustering Uncertain Data Based on Probability Distribution Similarity.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2013

A Partition-Based Approach to Structure Similarity Search.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Efficient Recovery of Missing Events.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2013

Towards semantic comparison of multi-granularity process traces.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2013

Probabilistic skyline operator over sliding windows.

[BibT_eX]

[DOI]

Inf. Syst., 2013

CTrace: semantic comparison of multi-granularity process traces.

[BibT_eX]

[DOI]

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

Efficiently computing k-edge connected components via graph decomposition.

[BibT_eX]

[DOI]

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

IRWR: incremental random walk with restart.

[BibT_eX]

[DOI]

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

Multi-Manifold Ranking: Using Multiple Features for Better Image Retrieval.

[BibT_eX]

[DOI]

Yang Wang

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2013

Towards efficient SimRank computation on large networks.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

Similarity query processing for probabilistic sets.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Data Engineering, 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

On Efficient Graph Substructure Selection.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 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

Towards metric fusion on multi-view data: a cross-view based graph random walk approach.

[BibT_eX]

[DOI]

Yang Wang

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

A space and time efficient algorithm for SimRank computation.

[BibT_eX]

[DOI]

World Wide Web, 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]

ACM Trans. Database Syst., 2012

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

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2012

Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods.

[BibT_eX]

[DOI]

J. Intell. Inf. Syst., 2012

Skyline: Stacking Optimal Solutions in Exact and Uncertain Worlds.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2012

DuoWave: Mitigating the curse of dimensionality for uncertain data.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2012

Human Action Recognition from Video Sequences by Enforcing Tri-view Constraints.

[BibT_eX]

[DOI]

Comput. J., 2012

A Space-Efficient Indexing Algorithm for Boolean Query Processing.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2012, 2012

On the Efficiency of Estimating Penetrating Rank on Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2012

TreeSpan: efficiently computing similarity all-matching.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 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

Efficient Graph Similarity Joins with Edit Distance Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012

Efficiently Monitoring Top-k Pairs over Sliding Windows.

[BibT_eX]

[DOI]

Haixun Wang

Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 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

Efficient Subgraph Similarity All-Matching.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2012

Top-k Similarity Join over Multi-valued Objects.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2012

Loyalty-based selection: retrieving objects that persistently satisfy criteria.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

2011

Ranking queries on uncertain data.

[BibT_eX]

[DOI]

Ming Hua

VLDB J., 2011

Efficient similarity joins for near-duplicate detection.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2011

SPARK2: Top-k Keyword Query in Relational Databases.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2011

Continuous Monitoring of Distance-Based Range Queries.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2011

Advanced topics in cloud computing.

[BibT_eX]

[DOI]

Keqiu Li

Laurence Tianruo Yang

J. Netw. Comput. Appl., 2011

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

[BibT_eX]

[DOI]

Inf. Syst., 2011

Subgraph Search over Massive Disk Resident Graphs.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2011

Efficient exact edit similarity query processing with the asymmetric signature scheme.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 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

A unified approach for computing top-k pairs in multidimensional space.

[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

A Unified Algorithm for Continuous Monitoring of Spatial Queries.

[BibT_eX]

[DOI]

Mahady Hasan

Proceedings of the Database Systems for Advanced Applications, 2011

2010

Threshold-based probabilistic top-k dominating queries.

[BibT_eX]

[DOI]

VLDB J., 2010

Sliding-window top-k queries on uncertain streams.

[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

Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2010

Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs.

[BibT_eX]

[DOI]

Jiajin Le

Proceedings of the Web-Age Information Management, 11th International Conference, 2010

PrefIndex: An Efficient Supergraph Containment Search Technique.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2010

MapDupReducer: detecting near duplicates over massive datasets.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 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]

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

Multi-guarded safe zone: An effective technique to monitor moving circular range queries.

[BibT_eX]

[DOI]

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

Probabilistic ranking over relations.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2010, 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

Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries.

[BibT_eX]

[DOI]

Mahady Hasan

Wenyu Qu

Proceedings of the Database Systems for Advanced Applications, 2010

A Space and Time Efficient Algorithm for SimRank Computation.

[BibT_eX]

[DOI]

Jiajin Le

Proceedings of the Advances in Web Technologies and Applications, 2010

Counting distinct objects over sliding windows.

[BibT_eX]

[DOI]

Proceedings of the Database Technologies 2010, 2010

2009

Data Sketch/Synopsis.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Top-k typicality queries and efficient query answering methods on large databases.

[BibT_eX]

[DOI]

VLDB J., 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

Efficient approximate entity extraction with edit distance constraints.

[BibT_eX]

[DOI]

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

Keyword search on structured and semi-structured data.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 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

Top-k Set Similarity Joins.

[BibT_eX]

[DOI]

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

Distance-Based Representative Skyline.

[BibT_eX]

[DOI]

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

2008

Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document.

[BibT_eX]

[DOI]

World Wide Web, 2008

A multi-resolution surface distance model for k-NN query processing.

[BibT_eX]

[DOI]

VLDB J., 2008

Ed-Join: an efficient algorithm for similarity joins with edit distance constraints.

[BibT_eX]

[DOI]

Chuan Xiao

Proc. VLDB Endow., 2008

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

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Sliding-window top-k queries on uncertain streams.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Continually Answering Constraint k - NN Queries in Unstructured P2P Systems.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2008

Efficient similarity joins for near duplicate detection.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on World Wide Web, 2008

Managing Uncertain Data: Probabilistic Approaches.

[BibT_eX]

[DOI]

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

Query answering techniques on uncertain and probabilistic data: tutorial summary.

[BibT_eX]

[DOI]

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

Ranking queries on uncertain data: a probabilistic threshold approach.

[BibT_eX]

[DOI]

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

Mining preferences from superior and inferior examples.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Spotting Significant Changing Subgraphs in Evolving Graphs.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

SPARK: A Keyword Search Engine on Relational Databases.

[BibT_eX]

[DOI]

Yi Luo

Proceedings of the 24th International Conference on Data Engineering, 2008

Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Data Engineering, 2008

Fast computing reachability labelings for large graphs with high compression rate.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2008, 2008

Aggregate Computation over Data Streams.

[BibT_eX]

[DOI]

Proceedings of the Progress in WWW Research and Development, 2008

2007

Error minimization in approximate range aggregates.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2007

Probabilistic Skylines on Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Efficiently Answering Top-k Typicality Queries on Large Databases.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Spark: top-k keyword query in relational databases.

[BibT_eX]

[DOI]

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

Summarizing Order Statistics over Data Streams with Duplicates.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

Computing Compressed Multidimensional Skyline Cubes Efficiently.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

Selecting Stars: The k Most Representative Skyline Operator.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

Finding Top-k Min-Cost Connected Trees in Databases.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

CircularTrip: An Effective Algorithm for Continuous k NN Queries.

[BibT_eX]

[DOI]

Yidong Yuan

Proceedings of the Advances in Databases: Concepts, 2007

Continuously Maintaining Order Statistics over Data Streams.

[BibT_eX]

[DOI]

Proceedings of the Database Technologies 2007. Proceedings of the Eighteenth Australasian Database Conference, 2007

2006

Towards multidimensional subspace skyline analysis.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2006

Summarizing level-two topological relations in large spatial datasets.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2006

A Multiresolution Terrain Model for Efficient Visualization Query Processing.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2006

Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2006

Efficient Computation of k-Medians over Data Streams Under Memory Constraints.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2006

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2006

Space-efficient Relative Error Order Sketch over Data Streams.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Data Engineering, 2006

Surface k-NN Query Processing.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Data Engineering, 2006

Fast Computation of Reachability Labeling for Large Graphs.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2006

Answering Constrained k-NN Queries in Unstructured P2P Systems.

[BibT_eX]

[DOI]

Proceedings of the Databases, 2006

2005

Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web-Age Information Management, 2005

Similarity Search with Implicit Object Features.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web-Age Information Management, 2005

Efficient Computation of the Skyline Cube.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Efficient Processing of XML Path Queries Using the Disk-based F&B Index.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

Locating Motifs in Time-Series Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005

Stabbing the Sky: Efficient Skyline Computation over Sliding Windows.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Data Engineering, 2005

Practical Indexing XML Document for Twig Query.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2005

Labeling Scheme and Structural Joins for Graph-Structured XML Data.

[BibT_eX]

[DOI]

Proceedings of the Web Technologies Research and Development - APWeb 2005, 7th Asia-Pacific Web Conference, Shanghai, China, March 29, 2005

Summarizing Spatial Relations - A Hybrid Histogram.

[BibT_eX]

[DOI]

Qing Liu

Yidong Yuan

Proceedings of the Web Technologies Research and Development - APWeb 2005, 7th Asia-Pacific Web Conference, Shanghai, China, March 29, 2005

Term Graph Model for Text Classification.

[BibT_eX]

[DOI]

Diep Bich Do

Proceedings of the Advanced Data Mining and Applications, First International Conference, 2005

2004

Delay Optimization in Quorum Consensus.

[BibT_eX]

[DOI]

Algorithmica, 2004

Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream.

[BibT_eX]

[DOI]

Jian Xu

Xiaofang Zhou

Proceedings of the Advances in Web-Age Information Management: 5th International Conference, 2004

A Scalable and I/O Optimal Skyline Processing Algorithm.

[BibT_eX]

[DOI]

Yi Luo

Hai-Xin Lu

Proceedings of the Advances in Web-Age Information Management: 5th International Conference, 2004

Direct Mesh: a Multiresolution Approach to Terrain Visualization.

[BibT_eX]

[DOI]

Kai Xu

Xiaofang Zhou

Proceedings of the 20th International Conference on Data Engineering, 2004

Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Data Engineering, 2004

Clustering Moving Objects for Spatio-temporal Selectivity Estimation.

[BibT_eX]

[DOI]

Proceedings of the Database Technologies 2004, 2004

2003

Towards area requirements for drawing hierarchically planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Confirmation: increasing resource availability for transactional workflows.

[BibT_eX]

[DOI]

Inf. Sci., 2003

Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets.

[BibT_eX]

[DOI]

Proceedings of 29th International Conference on Very Large Data Bases, 2003

Error Minimization for Approximate Computation of Range Aggregate.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Database Systems for Advanced Applications (DASFAA '03), 2003

Multi-resolution Algorithms for Building Spatial Histograms.

[BibT_eX]

[DOI]

Qing Liu

Yidong Yuan

Proceedings of the Database Technologies 2003, 2003

An Optimal Divide-Conquer Algorithm for 2D Skyline Queries.

[BibT_eX]

[DOI]

Hai-Xin Lu

Yi Luo

Proceedings of the Advances in Databases and Information Systems, 2003

2002

Foreword.

[BibT_eX]

[DOI]

Ding-Zhu Du

Theor. Comput. Sci., 2002

On Linear-Spline Based Histograms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web-Age Information Management, 2002

Graph Partition Based Muti-Way Spatial Joins.

[BibT_eX]

[DOI]

Hai-Xin Lu

Proceedings of the International Database Engineering & Applications Symposium, 2002

2001

Efficiently Computing Weighted Proximity Relationships in Spatial Databases.

[BibT_eX]

[DOI]

Proceedings of the Advances in Web-Age Information Management, 2001

Delay Optimizations in Quorum Consensus.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Improving Backward Recovery in Workflow Systems.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, Proceedings of the 7th International Conference on Database Systems for Advanced Applications (DASFAA 2001), 18-20 April 2001, 2001

On Processing Cycle Query's Strategy for Semistructure Data Model and Its Role in Design.

[BibT_eX]

[DOI]

Jiajin Le

Proceedings of the Sixth International Conference on Computer Supported Cooperative Work in Design, 2001

2000

Spring algorithms and symmetry.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Spatial Query Processing Using Generalized Filter.

[BibT_eX]

[DOI]

Int. J. Cooperative Inf. Syst., 2000

Efficient computation of a proximity matching in spatial databases.

[BibT_eX]

[DOI]

Xiaomei Zhou

Chengfei Liu

Data Knowl. Eng., 2000

On the computational complexity of edge concentration.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

An Efficient Distributed Algorithm for Computing Association Rules.

[BibT_eX]

[DOI]

Yijun Li

Chi Ping Tsang

Proceedings of the Web-Age Information Management, First International Conference, 2000

1999

Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules.

[BibT_eX]

[DOI]

Yijun Li

Chi Ping Tsang

Inf. Sci., 1999

Building a Repository for Workflow Systems.

[BibT_eX]

[DOI]

Proceedings of the TOOLS 1999: 31st International Conference on Technology of Object-Oriented Languages and Systems, 1999

Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment.

[BibT_eX]

[DOI]

Proceedings of the TOOLS 1999: 31st International Conference on Technology of Object-Oriented Languages and Systems, 1999

Efficiently Matching Proximity Relationships in Spatial Databases.

[BibT_eX]

[DOI]

Xiaomei Zhou

Chengfei Liu

Proceedings of the Advances in Spatial Databases, 1999

Confirmation: A Solution for Non-Compensatability in Workflow Applications.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Data Engineering, 1999

On the Optimization of Complex Spatial Queries.

[BibT_eX]

Proceedings of the Proceedings of the Second International Symposium on Cooperative Database Systems for Advanced Applications, 1999

Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1997

A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Area Requirements for Drawing Hierarchically Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

An Algorithm for Drawing a Hierarchical Graph.

[BibT_eX]

[DOI]

Roberto Tamassia

Int. J. Comput. Geom. Appl., 1996

An effective parallelization of execution of multijoins in multiprocessor systems.

[BibT_eX]

[DOI]

Simon Fox

Proceedings of the 1996 International Symposium on Parallel Architectures, 1996

An optimal deadlock resolution algorithm in multidatabase systems.

[BibT_eX]

[DOI]

Jian Chen

Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), 1996

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.

[BibT_eX]

[DOI]

Qing-Wen Feng

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems.

[BibT_eX]

[DOI]

Inf. Sci., 1995

An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 1995

A heuristic for the feedback arc set problem.

[BibT_eX]

[DOI]

Australas. J Comb., 1995

A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

A Fast and Effective Heuristic for the Feedback Arc Set Problem.

[BibT_eX]

[DOI]

W. F. Smyth

Inf. Process. Lett., 1993

Two Tree Drawing Conventions.

[BibT_eX]

[DOI]

Tao Lin

Int. J. Comput. Geom. Appl., 1993

A Graph Based Cluster Approach for Vertical Partitioning in Database Design.

[BibT_eX]

[DOI]

Yanchun Zhang

Data Knowl. Eng., 1993

Performance Guarantees for Motion Planning with Temporal Uncertainty.

[BibT_eX]

Nicholas C. Wormald

Aust. Comput. J., 1993

On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design.

[BibT_eX]

Yanchun Zhang

Proceedings of the Computing and Information, 1993

A New Graphical Method of Vertical Partitioning in Database Design.

[BibT_eX]

Yanchun Zhang

Proceedings of the Advances in Database Research, 1993

1992

Analysis of algorithms for drawing graphs

[BibT_eX]

[DOI]

PhD thesis, 1992

Minimum Size h-v Drawings.

[BibT_eX]

Tao Lin

Proceedings of the Advanced Visual Interfaces - Proceedings of the International Workshop, 1992

1989

How to draw a directed graph.

[BibT_eX]

[DOI]