Zobrazeno 1 - 10
of 310
pro vyhledávání: '"Viglas, A."'
Autor:
Wu, Xi, Zhu, Zichen, Yu, Xiangyao, Deep, Shaleen, Viglas, Stratis, Cieslewicz, John, Jha, Somesh, Naughton, Jeffrey F.
A range of data insight analytical tasks involves analyzing a large set of tables of different schemas, possibly induced by various groupings, to find salient patterns. This paper presents Multi-Relational Algebra, an extension of the classic Relatio
Externí odkaz:
http://arxiv.org/abs/2311.04824
Autor:
Wu, Xi, Deep, Shaleen, Benassi, Joe, Li, Fengan, Zhang, Yaqi, Jang, Uyeong, Foster, James, Kim, Stella, Sun, Yujing, Nguyen, Long, Viglas, Stratis, Jha, Somesh, Cieslewicz, John, Naughton, Jeffrey F.
Many data insight questions can be viewed as searching in a large space of tables and finding important ones, where the notion of importance is defined in some adhoc user defined manner. This paper presents Holistic Cube Analysis (HoCA), a framework
Externí odkaz:
http://arxiv.org/abs/2302.00120
This work studies the problem of constructing a representative workload from a given input analytical query workload where the former serves as an approximation with guarantees of the latter. We discuss our work in the context of workload analysis an
Externí odkaz:
http://arxiv.org/abs/2011.05549
Autor:
Víglaš, Ján, Olejníková, Petra
Publikováno v:
In Research in Microbiology June 2023 174(5)
Autor:
Víglaš, Ján *, Olejníková, Petra
Publikováno v:
In Microbiological Research May 2021 246
Autor:
Meimaris, Marios, Papastefanatos, George, Viglas, Stratis, Stavrakas, Yannis, Pateritsas, Christos, Anagnostopoulos, Ioannis
The Data Web refers to the vast and rapidly increasing quantity of scientific, corporate, government and crowd-sourced data published in the form of Linked Open Data, which encourages the uniform representation of heterogeneous data items on the web
Externí odkaz:
http://arxiv.org/abs/1504.01891
Autor:
Víglaš, Ján, Olejníková, Petra
Publikováno v:
In Research in Microbiology January-February 2021 172(1)
In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding $k$ new links. We consider the case that the new links must point to the given target node (backlinks). Previous work shows that this problem
Externí odkaz:
http://arxiv.org/abs/1204.1369
Autor:
Deep, Shaleen, Gruenheid, Anja, Nagaraj, Kruthi, Naito, Hiro, Naughton, Jeff, Viglas, Stratis
Publikováno v:
Communications of the ACM; Dec2022, Vol. 65 Issue 12, p105-112, 8p, 4 Diagrams, 1 Graph
Publikováno v:
Datenbank-Spektrum. 22:249-256