no code implementations • 13 Sep 2021 • Michael Leybovich, Oded Shmueli
We track the lineage of tuples throughout their database lifetime.
no code implementations • 14 Jul 2021 • Michael Leybovich, Oded Shmueli
For the case where all sets are singleton sets, essentially each is a single vector, there are known efficient approximate search algorithms, e. g., approximated versions of tree search algorithms, locality-sensitive hashing (LSH), vector quantization (VQ) and proximity graph algorithms.
no code implementations • 15 Apr 2020 • Rojeh Hayek, Oded Shmueli
Using the predicted percentages obtained via PUNQ, we are able to transform any cardinality estimation method that only estimates for conjunctive queries, and which estimates cardinalities with duplicates (e. g., MSCN), to a method that estimates queries cardinalities without duplicates.
no code implementations • 21 Aug 2019 • Rojeh Hayek, Oded Shmueli
Experimentally, our novel approach for estimating cardinalities, using containment rates between queries, on a challenging real-world database, realizes significant improvements to state of the art cardinality estimation methods.
no code implementations • 19 Dec 2017 • Rajesh Bordawekar, Bortik Bandyopadhyay, Oded Shmueli
We propose Cognitive Databases, an approach for transparently enabling Artificial Intelligence (AI) capabilities in relational databases.
no code implementations • 23 Mar 2016 • Rajesh Bordawekar, Oded Shmueli
We describe various techniques for extracting token sequences from a database.