62 citations · 101 across the 15 of their papers we have counts for
18 papers
A Demonstration of SQLyzr: A Platform for Fine-Grained Text-to-SQL Evaluation and Analysis
Sepideh Abedini, M. Tamer Özsu
Text-to-SQL models have significantly improved with the adoption of Large Language Models (LLMs), leading to their increasing use in real-world applications. Although many benchmar…
Efficient Cloud-edge Collaborative Approaches to SPARQL Queries over Large RDF graphs
Shidan Ma, Peng Peng, Xu Zhou +3
With the increasing use of RDF graphs, storing and querying such data using SPARQL remains a critical problem. Current mainstream solutions rely on cloud-based data management arch…
InteracSPARQL: An Interactive System for SPARQL Query Refinement Using Natural Language Explanations
Xiangru Jian, Zhengyuan Dong, M. Tamer Özsu
In recent years, querying semantic web data using SPARQL has remained challenging, especially for non-expert users, due to the language's complex syntax and the prerequisite of und…
Transient Concepts in Streaming Graphs
Aida Sheshbolouki, M. Tamer Ozsu
Concept Drift (CD) occurs when a change in a hidden context can induce changes in a target concept. CD is a natural phenomenon in non-stationary settings such as data streams. Unde…
Scale-Invariant Strength Assortativity of Streaming Butterflies
Aida Sheshbolouki, M. Tamer Özsu
Bipartite graphs are rich data structures with prevalent applications and identifier structural features. However, less is known about their growth patterns, particularly in stream…
sGrapp: Butterfly Approximation in Streaming Graphs
Aida Sheshbolouki, M. Tamer Özsu
We study the fundamental problem of butterfly (i.e. (2,2)-bicliques) counting in bipartite streaming graphs. Similar to triangles in unipartite graphs, enumerating butterflies is c…
Evaluating Complex Queries on Streaming Graphs
Anil Pacaci, Angela Bonifati, M. Tamer Özsu
We study the problem of evaluating persistent queries over streaming graphs in a principled fashion. These queries need to be evaluated over unbounded and very high speed graph str…
Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach
Guimu Guo, Da Yan, M. Tamer Özsu +2
Given a user-specified minimum degree threshold , a -quasi-clique is a subgraph where each vertex connects to at least fraction of the other vert…
Regular Path Query Evaluation on Streaming Graphs
Anil Pacaci, Angela Bonifati, M. Tamer Özsu
We study persistent query evaluation over streaming graphs, which is becoming increasingly important. We focus on navigational queries that determine if there exists a path between…
GSI: GPU-friendly Subgraph Isomorphism
Li Zeng, Lei Zou, M. Tamer Özsu +2
Subgraph isomorphism is a well-known NP-hard problem that is widely used in many applications, such as social network analysis and query over the knowledge graph. Due to the inhere…
Experimental Analysis of Distributed Graph Systems
Khaled Ammar, Tamer Ozsu
This paper evaluates eight parallel graph processing systems: Hadoop, HaLoop, Vertica, Giraph, GraphLab (PowerGraph), Blogel, Flink Gelly, and GraphX (SPARK) over four very large d…
Time Constrained Continuous Subgraph Search over Streaming Graphs
Youhuan Li, Lei Zou, M. Tamer Ozsu +1
The growing popularity of dynamic applications such as social networks provides a promising way to detect valuable information in real time. Efficient analysis over high-speed data…
G-thinker: Big Graph Mining Made Easier and Faster
Da Yan, Hongzhi Chen, James Cheng +3
This paper proposes a general system for compute-intensive graph mining tasks that find from a big graph all subgraphs that satisfy certain requirements (e.g., graph matching and c…
Walking without a Map: Optimizing Response Times of Traversal-Based Linked Data Queries (Extended Version)
Olaf Hartig, M. Tamer Özsu
The emergence of Linked Data on the WWW has spawned research interest in an online execution of declarative queries over this data. A particularly interesting approach is traversal…
Quegel: A General-Purpose Query-Centric Framework for Querying Big Graphs
Da Yan, James Cheng, M. Tamer Özsu +5
Pioneered by Google's Pregel, many distributed systems have been developed for large-scale graph analytics. These systems expose the user-friendly "think like a vertex" programming…
A Survey of RDF Data Management Systems
M. Tamer Özsu
RDF is increasingly being used to encode data for the semantic web and for data exchange. There have been a large number of works that address RDF data management. In this paper we…
Clustering RDF Databases Using Tunable-LSH
Güneş Aluç, M. Tamer Özsu, Khuzaima Daudjee
The Resource Description Framework (RDF) is a W3C standard for representing graph-structured data, and SPARQL is the standard query language for RDF. Recent advances in Information…
Processing SPARQL Queries Over Distributed RDF Graphs
Peng Peng, Lei Zou, M. Tamer Özsu +2
We propose techniques for processing SPARQL queries over a large RDF graph in a distributed environment. We adopt a "partial evaluation and assembly" framework. Answering a SPARQL…