All Stories

  1. Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings
  2. GCLS 2 : Towards Efficient Community Detection Using Graph Contrastive Learning with Structure Semantics
  3. Reproducibility Report for ACM SIGMOD 2024 Paper: 'CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation Models'
  4. Is Aggregation the Only Choice? Federated Learning via Layer-wise Model Recombination
  5. HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs
  6. $kt$-Safety: Graph Release via $k$-Anonymity and $t$-Closeness
  7. Range-constrained probabilistic mutual furthest neighbor queries in uncertain databases
  8. MonitorLight
  9. Efficient Processing of Group Planning Queries Over Spatial-Social Networks
  10. Maximizing the Utility in Location-Based Mobile Advertising
  11. Fast and Accurate SimRank Computation via Forward Local Push and its Parallelization
  12. Cohesive Group Nearest Neighbor Queries on Road-Social Networks under Multi-Criteria
  13. Online Topic-Aware Entity Resolution Over Incomplete Data Streams
  14. Top-k Community Similarity Search Over Large Road-Network Graphs
  15. A Comparative Study of Consistent Snapshot Algorithms for Main-Memory Database Systems
  16. Effective and efficient top-k query processing over incomplete data streams
  17. Efficiently Discovering Regions of Interest with User-Defined Score Function
  18. Topic-based community search over spatial-social networks
  19. Efficient Path Routing Over Road Networks in the Presence of Ad-Hoc Obstacles
  20. Distributed Multimodal Path Queries
  21. Probabilistic Maximum Range-Sum Queries on Spatial Database
  22. Efficient Join Processing Over Incomplete Data Streams
  23. GCache: Neighborhood-Guided Graph Caching in a Distributed Environment
  24. Skyline queries over incomplete data streams
  25. Constrained shortest path query in a large time-dependent graph
  26. FROG: A Fast and Reliable Crowdsourcing Framework
  27. Cohesive Group Nearest Neighbor Queries Over Road-Social Networks
  28. Maximizing the Utility in Location-Based Mobile Advertising
  29. Weight-Constrained Route Planning Over Time-Dependent Graphs
  30. An Efficient Probabilistic Approach for Graph Similarity Search
  31. Efficient SimRank Tracking in Dynamic Graphs
  32. On Efficiently Detecting Overlapping Communities over Distributed Dynamic Graphs
  33. Probabilistic Time-Constrained Paths Search over Uncertain Road Networks
  34. Matching Heterogeneous Event Data
  35. A Secure and Smart Framework for Monitoring Infants' Safety
  36. Second-order random walk-based proximity measures in graph analysis: formulations and algorithms
  37. Keyword Search over Distributed Graphs with Compressed Signature
  38. Efficient Ad-Hoc Graph Inference and Matching in Biological Databases
  39. Prediction-Based Task Assignment in Spatial Crowdsourcing
  40. Task Assignment on Multi-Skill Oriented Spatial Crowdsourcing
  41. Online Subgraph Skyline Analysis over Knowledge Graphs
  42. Quality-Aware Subgraph Matching Over Inconsistent Probabilistic Graph Databases
  43. RSkNN: kNN Search on Road Networks by Incorporating Social Influence
  44. Subgraph Matching with Set Similarity in a Large Graph Database
  45. Reliable diversity-based spatial crowdsourcing by moving workers
  46. How to Build Templates for RDF Question/Answering
  47. Keyword Search Over Probabilistic RDF Graphs
  48. Efficient Graph Similarity Search Over Large Graph Databases
  49. Efficient Subgraph Skyline Search Over Large Graphs
  50. Trip Planner Over Probabilistic Time-Dependent Road Networks
  51. Matching heterogeneous event data
  52. SQBC: An efficient subgraph matching method over large and dense graphs
  53. k-nearest keyword search in RDF graphs
  54. Efficient processing of probabilistic group subspace skyline queries in uncertain databases
  55. Probabilistic top-k dominating queries in uncertain databases
  56. Causality and responsibility
  57. Graph similarity search with edit distance constraint in large graph databases
  58. k-Nearest Keyword Search in RDF Graphs
  59. UTPB: A Benchmark for Scientific Workflow Provenance Storage and Querying Systems
  60. Continuous monitoring of skylines over uncertain data streams
  61. Subspace Similarity Search under {\rm L}_p-Norm
  62. Query Processing over Uncertain and Probabilistic Databases
  63. Similarity Join Processing on Uncertain Data Streams
  64. Finding the least influenced set in uncertain databases
  65. Shooting top-k stars in uncertain databases
  66. Cost-efficient repair in inconsistent probabilistic databases
  67. Efficient query answering in probabilistic RDF graphs
  68. Managing uncertain spatio-temporal data
  69. Probabilistic Time Consistent Queries over Moving Objects
  70. The World in a Nutshell: Concise Range Queries
  71. A generic framework for handling uncertain data with local correlations
  72. Set similarity join on probabilistic data
  73. Development of foundation models for Internet of Things
  74. Probabilistic inverse ranking queries in uncertain databases
  75. Consistent query answers in inconsistent probabilistic databases
  76. Ranked Query Processing in Uncertain Databases
  77. Reverse skyline search in uncertain databases
  78. Efficient Similarity Join over Multiple Stream Time Series
  79. General Cost Models for Evaluating Dimensionality Reduction in High-Dimensional Spaces
  80. Multiscale Representations for Fast Pattern Matching in Stream Time Series
  81. A Concise Representation of Range Queries
  82. Efficient Processing of Metric Skyline Queries
  83. Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data
  84. Efficient join processing on uncertain data streams
  85. Probabilistic Inverse Ranking Queries over Uncertain Data
  86. Top-k dominating queries in uncertain databases
  87. Efficient Pattern Matching over Uncertain Data Streams
  88. Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
  89. Pattern Matching over Cloaked Time Series
  90. Similarity Search in Arbitrary Subspaces Under Lp-Norm
  91. Dynamic skyline queries in metric spaces
  92. Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
  93. Efficient Similarity Search over Future Stream Time Series
  94. Monochromatic and bichromatic reverse skyline search over uncertain databases
  95. Probabilistic ranked queries in uncertain databases
  96. A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
  97. Approximate Similarity Search over Multiple Stream Time Series
  98. Random Sampling for Continuous Streams with Arbitrary Updates
  99. Similarity Match Over High Speed Time-Series Streams
  100. Multidimensional reverse kNN search
  101. Efficient Methods on Predictions for Similarity Search over Stream Time Series