Integrating data lake tables
We have made tremendous strides in providing tools for data scientists to discover new
tables useful for their analyses. But despite these advances, the proper integration of …
tables useful for their analyses. But despite these advances, the proper integration of …
Query plan reformulation
E Simon, F Llirbat, F Fabret, N Dieu… - US Patent …, 2014 - Google Patents
Apparatus, systems, and methods may operate to receive an original query plan, to
transform the original query plan into an equivalent executable compact query plan, and to …
transform the original query plan into an equivalent executable compact query plan, and to …
Querying communities in relational databases
Keyword search on relational databases provides users with insights that they can not easily
observe using the traditional RDBMS techniques. Here, an l-keyword query is specified by a …
observe using the traditional RDBMS techniques. Here, an l-keyword query is specified by a …
Static analysis and optimization of semantic web queries
Static analysis is a fundamental task in query optimization. In this article we study static
analysis and optimization techniques for SPARQL, which is the standard language for …
analysis and optimization techniques for SPARQL, which is the standard language for …
Fast maximal cliques enumeration in sparse graphs
In this paper, we consider the problem of generating all maximal cliques in a sparse graph in
polynomial delay. Given a graph G=(V, E) with n vertices and m edges, the latest and fastest …
polynomial delay. Given a graph G=(V, E) with n vertices and m edges, the latest and fastest …
Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games
In this paper, we tackle the challenging problem of Shapley value computation in data
markets in a novel setting of data assemblage tasks with binary utility functions among data …
markets in a novel setting of data assemblage tasks with binary utility functions among data …
Enumeration of enumeration algorithms
K Wasa - arXiv preprint arXiv:1605.05102, 2016 - arxiv.org
arXiv:1605.05102v2 [cs.DS] 25 May 2016 Page 1 arXiv:1605.05102v2 [cs.DS] 25 May 2016
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
S Cohen, B Kimelfeld, Y Sagiv - Journal of Computer and System Sciences, 2008 - Elsevier
This paper investigates a graph enumeration problem, called the maximalP-subgraphs
problem, where P is a hereditary or connected-hereditary graph property. Formally, given a …
problem, where P is a hereditary or connected-hereditary graph property. Formally, given a …
[PDF][PDF] Matching twigs in probabilistic XML
B Kimelfeld, Y Sagiv - … of the 33rd international conference on …, 2007 - researchgate.net
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and,
in particular, a query may be Boolean. It is shown that for a well-known model of probabilistic …
in particular, a query may be Boolean. It is shown that for a well-known model of probabilistic …
DIALITE: discover, align and integrate open data tables
We demonstrate a novel table discovery pipeline called DIALITE that allows users to
discover, integrate and analyze open data tables. DIALITE has three main stages. First, it …
discover, integrate and analyze open data tables. DIALITE has three main stages. First, it …