Filters








12,141 Hits in 4.3 sec

Technical perspectiveRelational query optimization

Surajit Chaudhuri
2009 Communications of the ACM  
The optimizer takes the query expression as input and determines how best to execute that query.  ...  Yet, statistical estimation problems for query expressions remain one area where significant advances are needed to take the next big leap in the state of the art for query optimization.  ...  The optimizer takes the query expression as input and determines how best to execute that query.  ... 
doi:10.1145/1562764.1562786 fatcat:z2nlikm6kvhtrjiabrv7sh3ety

A Signature Access Method for the Starburst Database System

Walter W. Chang, Hans-Jörg Schek
1989 Very Large Data Bases Conference  
A combinatorial error problem common to all multilevel signature structures is identified and addressed.  ...  Performance of this signature generation scheme improves as more key fields are provided in the query.  ...  In relational database systems, queries are traditionally answered by executing a plan generated by a query optimizer.  ... 
dblp:conf/vldb/ChangS89 fatcat:f74paia6cfbfjgjwzyjjqcymqe

Page 4768 of Mathematical Reviews Vol. , Issue 90H [page]

1990 Mathematical Reviews  
A matrix is used as the basic model of a database for theoretical studies of extremal combinatorial problems. Section 2 defines all database concepts needed for the material discussed in the paper.  ...  (H-AOS) Extremal combinatorial problems of database models. MFDBS 87 (Dresden, 1987), 99-127, Lecture Notes in Comput. Sci., 305, Springer, Berlin-New York, 1988.  ... 

Learning Models over Relational Data: A Brief Tutorial [article]

Maximilian Schleich, Dan Olteanu, Mahmoud Abo-Khamis, Hung Q. Ngo, XuanLong Nguyen
2019 arXiv   pre-print
An alternative approach is to cast the machine learning problem as a database problem by transforming the data-intensive component of the learning task into a batch of aggregates over the feature extraction  ...  query and by computing this batch directly over the input database.  ...  data reside and the training dataset is constructed, and the machine learning library (statistical software package), which casts the model training problem as an optimization problem.  ... 
arXiv:1911.06577v1 fatcat:abducdaga5dqvddmszjjhi7xci

Linear spaces and transversal designs: k-anonymous combinatorial configurations for anonymous database search notes

Klara Stokes, Oriol Farràs
2012 Designs, Codes and Cryptography  
Given a set of requirements on the protocol, the search for the optimal distribution of communication spaces and keys can be defined as a combinatorial problem with constraints.  ...  The users send queries to the database on behalf of other users, without revealing to the database the identity of the owner of the query.  ...  As can be deduced from [18] , the linear spaces are optimal configurations with respect to maximal diffusion of the query profiles.  ... 
doi:10.1007/s10623-012-9745-8 fatcat:yl7xkkfbljhfddfhftxi5fzcly

Special Issue on Database Theory

Pablo Barceló, Marco Calautti
2020 Theory of Computing Systems  
cosine similarity queries over vector databases. This problem is of practical importance, arising in important applications such as document retrieval recommender systems, and mass spectrometry.  ...  answers to conjunctive queries over databases that may violate primary key constraints.  ... 
doi:10.1007/s00224-020-10006-9 fatcat:wkb5elkodzbv5npzzpzyogrhue

Combining Relational Algebra, SQL, Constraint Modelling, and Local Search [article]

Marco Cadoli, Toni Mancini
2006 arXiv   pre-print
To this end we propose extensions of standard query languages such as relational algebra and SQL, by adding constraint modelling capabilities to them.  ...  In particular, we propose non-deterministic extensions of both languages, which are specially suited for combinatorial problems.  ...  problems, based on a high-level language, and techniques for intensional reasoning and local search".  ... 
arXiv:cs/0601043v1 fatcat:my6zfudnefe2vhbm4f7tx6rbe4

New kids on the block: novel informatics methods for natural product discovery

Franziska Hufsky, Kerstin Scheubert, Sebastian Böcker
2014 Natural product reports (Print)  
technique combinatorial optimization machine learning machine learning combinatorial optimization Molecular structure database required?  ...  The query FT of the unknown compound is aligned to each FT in the combined database that contains target as well as decoy FTs. Hits (pairs of query and reference FT) are sorted by score.  ... 
doi:10.1039/c3np70101h pmid:24752343 fatcat:irgbxvk3kbbujhtupxpahpe7xu

Optimization of large join queries: combining heuristics and combinatorial techniques

A. Swami
1989 SIGMOD record  
We investigate the use of heuristics in optimizing queries with a large number of joins.  ...  We also study the combination of these heuristics with two general combinatorial optimization techniques, iterative improvement and simulated annealing, that were studied in a previous paper.  ...  The research is supported by Hewlett-Packard Laboratories under the contract titled "Research in Relational Database Management Systems" and, earlier, by DARPA contract N00039-84-C-0211 for Knowledge Based  ... 
doi:10.1145/66926.66961 fatcat:yiaom2uoqzcpri3wgr35gtzsqa

Page 2361 of Mathematical Reviews Vol. , Issue 95d [page]

1995 Mathematical Reviews  
Summary: “The containment and minimization of conjunctive queries are two basic problems of query optimization in rela- tional and deductive databases.  ...  For (in)equality queries, however, the containment problem has re- cently been proved to be IIf-complete, while the complexity of  ... 

An automated, yet interactive and portable DB designer

Ioannis Alagiannis, Debabrata Dash, Karl Schnaitter, Anastasia Ailamaki, Neoklis Polyzotis
2010 Proceedings of the 2010 international conference on Management of data - SIGMOD '10  
It provides close to optimal suggestions for indexes for a given workload by modeling the problem as a combinatorial optimization problem and solving it by sophisticated and mature solvers.  ...  Tuning tools attempt to configure a database to achieve optimal performance for a given workload.  ...  It takes as input the query workload, the physical design and size constraints. Then, it develops a convex combinatorial optimization formulation for the index selection problem.  ... 
doi:10.1145/1807167.1807314 dblp:conf/sigmod/AlagiannisDSAP10 fatcat:geo6u4mfpbge5gooeh4kah3k6e

Database Virtualization: A New Frontier for Database Tuning and Physical Design

Ahmed A. Soror, Ashraf Aboulnaga, Kenneth Salem
2007 2007 IEEE 23rd International Conference on Data Engineering Workshop  
We present an approach to this cost modeling that relies on using the query optimizer in a special virtualization-aware "what-if" mode.  ...  This has many benefits, but it also introduces new tuning and physical design problems that are of interest to the database research community.  ...  This is a combinatorial optimization problem, and the framework to solve it is presented in Figure 2 .  ... 
doi:10.1109/icdew.2007.4401021 dblp:conf/icde/SororAS07 fatcat:kqoqub67w5ai5bmjeqr2g3f4c4

Optimizing index deployment order for evolving OLAP

Hideaki Kimura, Carleton Coffrin, Alexander Rasin, Stanley B. Zdonik
2012 Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12  
As the first step in this direction, we study the problem of ordering index deployment.  ...  Many database applications deploy hundreds or thousands of indexes to speed up query execution.  ...  Hence, we consider CP and local search as the primary approach for our next step towards a database design tool that incrementally optimizes databases.  ... 
doi:10.1145/2247596.2247630 dblp:conf/edbt/KimuraCRZ12 fatcat:hm47p2zbvfcxhe3ph4khw663ka

Combining relational algebra, SQL, constraint modelling, and local search

MARCO CADOLI, TONI MANCINI
2007 Theory and Practice of Logic Programming  
To this end we propose extensions of standard query languages such as relational algebra andSQL, by adding constraint modelling capabilities to them.  ...  In particular, we propose non-deterministic extensions of both languages, which are specially suited for combinatorial problems.  ...  problems, based on a high-level language, and techniques for intensional reasoning and local search".  ... 
doi:10.1017/s1471068406002857 fatcat:p7spav444jgxpnz2b4sfgj2jde

Mining Hidden Populations through Attributed Search [article]

Suhansanu Kumar, Heting Gao, Changyu Wang, Hari Sundaram, Kevin Chen-Chuan Chang
2019 arXiv   pre-print
Finding individuals who belong to these populations on social networks is hard because they are non-queryable, and the sampler has to explore from a combinatorial query space within a finite budget limit  ...  Researchers often query online social platforms through their application programming interfaces (API) to find target populations such as people with mental illness De-Choudhury2017 and jazz musicians  ...  To address these challenges, we modeled the problem as a Multi-Armed Bandit problem.  ... 
arXiv:1905.04505v1 fatcat:woavlvneizbo7dnq7y5akli2xu
« Previous Showing results 1 — 15 out of 12,141 results