312 results on '"M. Tamer Özsu"'
Search Results
2. Optimizing LSM-based indexes for disaggregated memory.
3. Minimum motif-cut: a workload-aware RDF graph partitioning strategy.
4. Incremental Sliding Window Connectivity over Streaming Graphs.
5. GAMMA: A Graph Pattern Mining Framework for Large Graphs on GPU.
6. dLSM: An LSM-Based Index for Memory Disaggregation.
7. gFOV: A Full-Stack SPARQL Query Optimizer & Plan Visualizer.
8. An Overview of Reachability Indexes on Graphs.
9. The Future of Graph Analytics.
10. Low-Latency Sliding Window Connectivity.
11. Front Matter.
12. Incremental Sliding Window Connectivity over Streaming Graphs.
13. sGrow: Explaining the Scale-Invariant Strength Assortativity of Streaming Butterflies.
14. Data Science - A Systematic Treatment.
15. SGSI - A Scalable GPU-Friendly Subgraph Isomorphism Algorithm.
16. Evaluating Complex Queries on Streaming Graphs.
17. Exploiting Hierarchical Parallelism and Reusability in Tensor Kernel Processing on Heterogeneous HPC Systems.
18. MPC: Minimum Property-Cut RDF Graph Partitioning.
19. Preface SDA.
20. sGrapp: Butterfly Approximation in Streaming Graphs.
21. G-thinker: a general distributed framework for finding qualified subgraphs in a big graph with load balancing.
22. The Case for Distributed Shared-Memory Databases with RDMA-Enabled Memory Disaggregation.
23. Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs.
24. Space-Efficient Subgraph Search Over Streaming Graph With Timing Order Constraint.
25. Indexing Techniques for Graph Reachability Queries.
26. Efficient Execution of SPARQL Queries with OPTIONAL and UNION Expressions.
27. Data Science: A Systematic Treatment.
28. Reminiscences on Influential Papers.
29. G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph.
30. GSI: GPU-friendly Subgraph Isomorphism.
31. ELite: Cost-effective Approximation of Exploration-based Graph Analysis.
32. Regular Path Query Evaluation on Streaming Graphs.
33. The future is big graphs: a community view on graph processing systems.
34. Distributed Database Systems: The Case for NewSQL.
35. Optimizing Multi-Query Evaluation in Federated RDF Systems.
36. The Case for Distributed Shared-Memory Databases with RDMA-Enabled Memory Disaggregation.
37. Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs.
38. Time Constrained Continuous Subgraph Search Over Streaming Graphs.
39. Experimental Analysis of Streaming Algorithms for Graph Partitioning.
40. A Systematic View of Data Science.
41. The ubiquity of large graphs and surprising challenges of graph processing: extended survey.
42. Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach.
43. aeSpTV: An Adaptive and Efficient Framework for Sparse Tensor-Vector Product Kernel on a High-Performance Computing Platform.
44. Multi-query Optimization in Federated RDF Systems.
45. Stream WatDiv: A Streaming RDF Benchmark.
46. Distribution-Aware Stream Partitioning for Distributed Stream Processing Systems.
47. Evaluating Complex Queries on Streaming Graphs.
48. GSmart: An Efficient SPARQL Query Engine Using Sparse Matrix Algebra - Full Version.
49. Scale-Invariant Strength Assortativity of Streaming Butterflies.
50. sGrapp: Butterfly Approximation in Streaming Graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.