arXiv subjects

Abdul Hameed

Publications and source records attributed to Abdul Hameed.

3 recordsLinked to original sources

arXiv2026

Making Databases Searchable with Deep Context

Databases are the most critical assets for enterprises, and yet they remain largely inaccessible to people who make the most important decisions. In this paper, we describe the Tursio search platform that builds an abstraction layer, aka semantic knowledge graph, over the underlying databases to make them searchable in natural language. Tursio infuses large language models (LLMs) into every part of the query processing stack, including data modeling, query compilation, query planning, and result reasoning. This allows Tursio to process natural language queries systematically using techniques from traditional query planning and rewriting, rather than black-box memorization. We describe the architecture of Tursio in detail and present a comprehensive evaluation on production workloads, and synthetic and realistic benchmarks. Our results show that Tursio achieves high accuracy while being efficient and scalable, making databases truly searchable for non-expert users.

cs.DB↗

arXiv2023

Integral Laplacian graphs with a unique double Laplacian eigenvalue, II

The set $S_{\{i,j\}_{n}^{m}}=\{0,1,2,\ldots,m-1,m,m,m+1,\ldots,n-1,n\}\setminus\{i,j\},\quad 0<i<j\leqslant n$, is called Laplacian realizable if there exists a simple connected graph $G$ whose Laplacian spectrum is $S_{\{i,j\}_{n}^{m}}$. In this case, the graph $G$ is said to realize $S_{\{i,j\}_{n}^{m}}$. In this paper, we completely describe graphs realizing the sets $S_{\{i,j\}_{n}^{m}}$ with $m=1,2$ and determine the structure of these graphs.

math.CO↗

arXiv2022

Integral Laplacian graphs with a unique double Laplacian eigenvalue, I

The set $S_{i,n}=\{0,1,2,\ldots,n-1,n\}\setminus\{i\}$, $1\leqslant i\leqslant n$ is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is $S_{i,n}$. The existence of such graphs was established by S. Fallat et al. in 2005. In this paper, we investigate graphs whose Laplacian spectra have the form $$ S_{\{i,j\}_{n}^{m}}=\{0,1,2,\ldots,m-1,m,m,m+1,\ldots,n-1,n\}\setminus\{i,j\},\qquad 0<i<j\leqslant n, $$ and completely describe those ones with $m=n-1$ and $m=n$. We also show close relations between graphs realizing $S_{i,n}$ and $S_{\{i,j\}_{n}^{m}}$, and discuss the so-called $S_{n,n}$-conjecture and the correspondent conjecture for $S_{\{i,n\}_{n}^{m}}$.

math.CO↗