Related papers: LIKE Patterns and Complexity
Formulating efficient SQL queries requires several cycles of tuning and execution, particularly for inexperienced users. We examine methods that can accelerate and improve this interaction by providing insights about SQL queries prior to…
HyperQPTL and HyperQPTL$^+$ are expressive specification languages for hyperproperties, properties that relate multiple executions of a system. Tight complexity bounds are known for HyperQPTL finite-state satisfiability and model-checking.…
Multi-model databases are designed to store, manage, and query data in various models, such as relational, hierarchical, and graph data, simultaneously. In this paper, we provide a theoretical basis for querying categorical databases. We…
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating together preferences of multiple agents. We study here the…
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…
Translating natural language to SQL for data retrieval has become more accessible thanks to code generation LLMs. But how hard is it to generate SQL code? While databases can become unbounded in complexity, the complexity of queries is…
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…
We introduce a type and effect system, for an imperative object calculus, which infers "sharing" possibly introduced by the evaluation of an expression, represented as an equivalence relation among its free variables. This direct…
In this paper we introduce the notion of the $P$-sequences and apply their properties in studying representability of real numbers. Another application of $P$-sequences we find in generating the Prouhet-Tarry-Escott pairs.
We augment LP with a strong conditional operator, to yield a logic we call "strong LP," or LP=>. The resulting logic can speak of consistency in more discriminating ways, but introduces new possibilities for trivializing paradoxes.
Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases,…
This paper discusses a method for implementing a probabilistic inference system based on an extended relational data model. This model provides a unified approach for a variety of applications such as dynamic programming, solving sparse…
Skyline queries are frequently used in data analytics and multi-criteria decision support applications to filter relevant information from big amounts of data. Apache Spark is a popular framework for processing big, distributed data. The…
We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…
Real and complex norms of a linear operator acting on a normed complexified space are considered. Bounds on the ratio of these norms are given. The real and complex norms are shown to coincide for four classes of operators: 1) real linear…
This is a survey of the author's recent results on the Kadison and Halmos similarity problems and the closely connected notion of ``length'' of an operator algebra.
The execution logs that are used for process mining in practice are often obtained by querying an operational database and storing the result in a flat file. Consequently, the data processing power of the database system cannot be used…
In this article we develop a general technique which takes a known characterization of a property for weighted backward shifts and lifts it up to a characterization of that property for a large class of operators on $L^p(X)$. We call these…
In the domain of high-energy physics (HEP), query languages in general and SQL in particular have found limited acceptance. This is surprising since HEP data analysis matches the SQL model well: the data is fully structured and queried…