| Autoregressive Image Generation using Residual Quantization | 0 | 0.34 | 2022 |
| PLAYPEN: Plug-and-Play Visual Graph Query Interfaces for Top-down and Bottom-Up Search on Large Networks | 0 | 0.34 | 2022 |
| Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions | 0 | 0.34 | 2022 |
| Contrastive Regularization for Semi-Supervised Learning. | 0 | 0.34 | 2022 |
| Learned Cardinality Estimation: An In-depth Study | 0 | 0.34 | 2022 |
| Towards plug-and-play visual graph query interfaces: data-driven selection of canned patterns for large networks | 0 | 0.34 | 2021 |
| Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2 | 0.36 | 2021 |
| Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Canned Pattern Selection for Large Networks. | 0 | 0.34 | 2021 |
| Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation | 0 | 0.34 | 2021 |
| iTurboGraph: Scaling and Automating Incremental Graph Analytics | 0 | 0.34 | 2021 |
| Symmetric continuous subgraph matching with bidirectional dynamic programming | 0 | 0.34 | 2021 |
| Regularizing Attention Networks For Anomaly Detection In Visual Question Answering | 0 | 0.34 | 2021 |
| Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming. | 0 | 0.34 | 2021 |
| Scalable Graph Isomorphism: Combining Pairwise Color Refinement And Backtracking Via Compressed Candidate Space | 0 | 0.34 | 2021 |
| G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching | 1 | 0.35 | 2020 |
| Asymmetric-Partition Replication for Highly Scalable Distributed Transaction Processing in Practice. | 0 | 0.34 | 2020 |
| IDAR: Fast Supergraph Search Using DAG Integration. | 0 | 0.34 | 2020 |
| Natural language to SQL: Where are we today? | 0 | 0.34 | 2020 |
| Towards Multi-way Join Aware Optimizer in SAP HANA. | 0 | 0.34 | 2020 |
| Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 10 | 0.46 | 2019 |
| Fast and Robust Distributed Subgraph Enumeration. | 0 | 0.34 | 2019 |
| Fast and Robust Distributed Subgraph Enumeration. | 2 | 0.36 | 2019 |
| PANDA: a system for partial topology-based search on large networks | 0 | 0.34 | 2018 |
| TurboGraph++: A Scalable and Fast Graph Analytics System. | 4 | 0.41 | 2018 |
| Parallel replication across formats for scaling out mixed OLTP/OLAP workloads in main-memory databases. | 0 | 0.34 | 2018 |
| PANDA: A System for Partial Topology-based Search on Large Networks. | 0 | 0.34 | 2018 |
| TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data. | 5 | 0.40 | 2018 |
| Influence maximization based on reachability sketches in dynamic graphs. | 5 | 0.40 | 2017 |
| Parallel Replication across Formats in SAP HANA for Scaling Out Mixed OLTP/OLAP Workloads. | 0 | 0.34 | 2017 |
| Language integrated queries: towards standard logics for big data analytics (NII Shonan Meeting 2017-6). | 0 | 0.34 | 2017 |
| Parallel replication across formats in SAP HANA for scaling out mixed OLTP/OLAP workloads | 1 | 0.35 | 2017 |
| Scalable and parallelizable influence maximization with Random Walk Ranking and Rank Merge Pruning. | 5 | 0.40 | 2017 |
| DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine. | 14 | 0.48 | 2016 |
| Hybrid Garbage Collection for Multi-Version Concurrency Control in SAP HANA. | 5 | 0.42 | 2016 |
| Fast and Robust Parallel SGD Matrix Factorization | 19 | 0.59 | 2015 |
| Developing a hybrid dictionary-based bio-entity recognition technique | 5 | 0.43 | 2015 |
| DSP-CC: I/O Efficient Parallel Computation of Connected Components in Billion-scale Networks | 2 | 0.36 | 2015 |
| DB-IR integration using tight-coupling in the Odysseus DBMS | 2 | 0.37 | 2015 |
| An efficient algorithm for updating regular expression indexes in RDF databases | 0 | 0.34 | 2015 |
| Towards intelligent in-vehicle sensor database management systems | 1 | 0.35 | 2015 |
| Taming Subgraph Isomorphism for RDF Query Processing. | 0 | 0.34 | 2015 |
| Taming Subgraph Isomorphism for RDF Query Processing | 20 | 0.62 | 2015 |
| The G* graph database: efficiently managing large distributed dynamic graphs | 15 | 0.59 | 2015 |
| OPT: a new framework for overlapped and parallel triangulation in large-scale graphs | 24 | 0.69 | 2014 |
| Leveraging spatial join for robust tuple extraction from web pages | 1 | 0.35 | 2014 |
| iKernel: Exact indexing for support vector machines | 1 | 0.35 | 2014 |
| Processing time-dependent shortest path queries without pre-computed speed information on road networks | 7 | 0.48 | 2014 |
| BoDBES: a boosted dictionary-based biomedical entity spotter | 1 | 0.35 | 2013 |
| Partitioned-Tree Nested Loop Join: An Efficient Join For Spatio-Temporal Interval Join | 0 | 0.34 | 2013 |
| TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC | 107 | 2.77 | 2013 |
