9 results on '"*QUERY languages (Computer science)"'
Search Results
2. Succinct Range Filters.
- Author
-
Huanchen Zhang, Lim, Hyeontaek, Leis, Viktor, Andersen, David G., Kaminsky, Michael, Keeton, Kimberly, and Pavlo, Andrew
- Subjects
- *
QUERY languages (Computer science) , *DATABASES , *COMPUTER storage capacity , *INFORMATION theory - Abstract
We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both singlekey lookups and common range queries, such as range counts. SuRF is based on a new data structure called the Fast Succinct Trie (FST) that matches the performance of state-of-the-art order-preserving indexes, while consuming only 10 bits per trie node--a space close to the minimum required by information theory. Our experiments show that SuRF speeds up range queries in a widely used database storage engine by up to 5×. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
3. To Draw Is Human: Toward No-Code Subgraph Search.
- Author
-
BHOWMICK, SOURAV S. and BYRON CHOI
- Subjects
- *
QUERYING (Computer science) , *VISUAL programming languages (Computer science) , *QUERY languages (Computer science) , *USER interfaces , *COMPUTER programming , *PLUG & play (Computer architecture) - Abstract
This article proposes a solution to the existing visual query interface (VQI) setbacks with a plug-and-play method and blending visual query formulation with query processing. While VQIs contribute to the no-code or low-code frameworks necessary to counteract the worldwide developer shortage, talent gap and budgetary constraints they traditionally require high creation and maintenance costs, poor portability, and lack of support for subgraph query formation.
- Published
- 2023
- Full Text
- View/download PDF
4. Pivot Tracing: Dynamic Causal Monitoring for Distributed Systems.
- Author
-
Mace, Jonathan, Roelke, Ryan, and Fonseca, Rodrigo
- Subjects
- *
COMPUTER systems , *DEBUGGING , *COMPUTER science , *ELECTRONIC data processing , *QUERY languages (Computer science) - Abstract
Monitoring and troubleshooting distributed systems are notoriously difficult; potential problems are complex, varied, and unpredictable. The monitoring and diagnosis tools commonly used today—logs, counters, and metrics—have two important limitations: what gets recorded is defined a priori, and the information is recorded in a component- or machine-centric way, making it extremely hard to correlate events that cross these boundaries. This paper presents Pivot Tracing, a monitoring framework for distributed systems that addresses both limitations by combining dynamic instrumentation with a novel relational operator: the happened-before join. Pivot Tracing gives users, at runtime, the ability to define arbitrary metrics at one point of the system, while being able to select, filter, and group by events meaningful at other parts of the system, even when crossing component or machine boundaries. Pivot Tracing does not correlate cross-component events using expensive global aggregations, nor does it perform offline analysis. Instead, Pivot Tracing directly correlates events as they happen by piggybacking metadata alongside requests as they execute. This gives Pivot Tracing low runtime overhead—less than 1% for many cross-component monitoring queries. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
5. Scalable Computation of High-Order Optimization Queries.
- Author
-
Brucato, Matteo, Abouzied, Azza, and Meliou, Alexandra
- Subjects
- *
QUERYING (Computer science) , *CONSTRAINED optimization , *QUERY languages (Computer science) , *COMPUTER programming , *DATABASE searching - Abstract
Constrained optimization problems are at the heart of significant applications in a broad range of domains, including finance, transportation, manufacturing, and healthcare. Modeling and solving these problems has relied on application-specific solutions, which are often complex, error-prone, and do not generalize. Our goal is to create a domain-independent, declarative approach, supported and powered by the system where the data relevant to these problems typically resides: the database. We present a complete system that supports package queries, a new query model that extends traditional database queries to handle complex constraints and preferences over answer sets, allowing the declarative specification and efficient evaluation of a significant class of constrained optimization problems—integer linear programs (ILP)—within a database. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
6. Multi-Objective Parametric Query Optimization.
- Author
-
Trummer, Immanuel and Koch, Christoph
- Subjects
- *
QUERY languages (Computer science) , *PROGRAM transformation , *DATA structures , *DATABASES , *ALGORITHMS - Abstract
We propose a generalization of the classical database query optimization problem: multi-objective parametric query (MPQ) optimization. MPQ compares alternative processing plans according to multiple execution cost metrics. It also models missing pieces of information on which plan costs depend upon as parameters. Both features are crucial to model query processing on modern data processing platforms. MPQ generalizes previously proposed query optimization variants, such as multi-objective query optimization, parametric query optimization, and traditional query optimization. We show, however, that the MPQ problem has different properties than prior variants and solving it requires novel methods. We present an algorithm that solves the MPQ problem and finds, for a given query, the set of all relevant query plans. This set contains all plans that realize optimal execution cost tradeoffs for any combination of parameter values. Our algorithm is based on dynamic programming and recursively constructs relevant query plans by combining relevant plans for query parts. We assume that all plan execution cost functions are piecewise-linear in the parameters. We use linear programming to compare alternative plans and to identify plans that are not relevant. We present a complexity analysis of our algorithm and experimentally evaluate its performance. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
7. NoDB: Efficient Query Execution on Raw Data Files.
- Author
-
Alagiannis, loannis, Borovica-Gajic, Renata, Branco, Miguel, Idreos, Stratos, and Ailamaki, Anastasia
- Subjects
- *
DATABASE management , *TECHNOLOGICAL innovations , *DATABASE management software , *QUERY languages (Computer science) , *DATA analysis software , *SOCIAL network analysis - Abstract
As data collections become larger and larger, users are faced with increasing bottlenecks in their data analysis. More data means more time to prepare and to load the data into the database before executing the desired queries. Many applications already avoid using database systems, for example, scientific data analysis and social networks, due to the complexity and the increased data-to-query time, that is, the time between getting the data and retrieving its first useful results. For many applications data collections keep growing fast, even on a daily basis, and this data deluge will only increase in the future, where it is expected to have much more data than what we can move or store, let alone analyze. We here present the design and roadmap of a new paradigm in database systems, called NoDB, which do not require data loading while still maintaining the whole feature set of a modern database system. In particular, we show how to make raw data files a first-class citizen, fully integrated with the query engine. Through our design and lessons learned by implementing the NoDB philosophy over a modern Database Management Systems (DBMS), we discuss the fundamental limitations as well as the strong opportunities that such a research path brings. We identify performance bottlenecks specific for in situ processing, namely the repeated parsing and tokenizing overhead and the expensive data type conversion. To address these problems, we introduce an adaptive indexing mechanism that maintains positional information to provide efficient access to raw data files, together with a flexible caching structure. We conclude that NoDB systems are feasible to design and implement over modern DBMS, bringing an unprecedented positive effect in usability and performance. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
8. The Strength of SuRF.
- Author
-
Idreos, Stratos
- Subjects
- *
QUERY languages (Computer science) , *COMPUTER architecture - Abstract
An introduction is presented in which the author discusses an article published in the journal about the trie-based structure known as Succinct Range Filter (SuRF).
- Published
- 2021
- Full Text
- View/download PDF
9. Broadening and Deepening Query Optimization Yet Still Making Progress.
- Author
-
Naughton, Jeffrey F.
- Subjects
- *
QUERY languages (Computer science) , *PROGRAM transformation , *DATABASES - Abstract
The article discusses the computer data management concept of query optimization, and introduces an article in the journal on the subject of parametric and multi-objective query optimization.
- Published
- 2017
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.