All Stories

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