Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Wolfgang Gatterbauer"'
Publikováno v:
Proceedings of the VLDB Endowment. 16:932-945
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 discovered tables has been under-explored. An interesting semantics for int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::841854489e7e6e7c5e7a34eedceec157
https://doi.org/10.14778/3574245.3574274
https://doi.org/10.14778/3574245.3574274
Publikováno v:
IEEE Transactions on Visualization and Computer Graphics. 28:324-334
Node-link visualizations are a familiar and powerful tool for displaying the relationships in a network. The readability of these visualizations highly depends on the spatial layout used for the nodes. In this paper, we focus on computing layered lay
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d521a07cd86192e2beae287cc6fea03
https://doi.org/10.1109/tvcg.2021.3114756
https://doi.org/10.1109/tvcg.2021.3114756
Publikováno v:
2022 IEEE 38th International Conference on Data Engineering (ICDE).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62cc880420422c414b09bd0c2efd19bc
https://doi.org/10.1109/icde53745.2022.00299
https://doi.org/10.1109/icde53745.2022.00299
Publikováno v:
Proc 5th Int Workshop Explor Search Databases Web (2018)
ExploreDB@SIGMOD/PODS
ExploreDB@SIGMOD/PODS
We recently proposed the notion of any-k queries, together with the KARPET algorithm, for tree-pattern search in labeled graphs. Any-k extends top-k by not requiring a pre-specified value of k. Instead, an any-k algorithm returns as many of the top-r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::775068330a6a60cfd20c99d714f7605b
https://pubmed.ncbi.nlm.nih.gov/34327518
https://pubmed.ncbi.nlm.nih.gov/34327518
We study theta-joins in general and join predicates with conjunctions and disjunctions of inequalities in particular, focusing on ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function. Our ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d13d1be2cf2b8b3462b6b64f749d6a1c
Publikováno v:
PODS
We study the question of when we can provide direct access to the k-th answer to a Conjunctive Query (CQ) according to a specified order over the answers in time logarithmic in the size of the database, following a preprocessing step that constructs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b742d585e1206f9df89ac8b5d0e5881d
http://arxiv.org/abs/2012.11965
http://arxiv.org/abs/2012.11965
Publikováno v:
Proc ACM SIGMOD Int Conf Manag Data
SIGMOD Conference
SIGMOD Conference
Top-k queries have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are needed instead of the full output. While some optimality results exist,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d13e73ac972de6ea86d0202eb6ec5512
https://europepmc.org/articles/PMC7872590/
https://europepmc.org/articles/PMC7872590/
Publikováno v:
SIGMOD Conference
Proc ACM SIGMOD Int Conf Manag Data
Proc ACM SIGMOD Int Conf Manag Data
We consider running-time optimization for band-joins in a distributed system, e.g., the cloud. To balance load across worker machines, input has to be partitioned, which causes duplication. We explore how to resolve this tension between maximum load
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f93092d8d24bef40437be333e9d8339b
https://doi.org/10.1145/3318464.3389750
https://doi.org/10.1145/3318464.3389750
Publikováno v:
SIGMOD Conference
Node classification is an important problem in graph data management. It is commonly solved by various label propagation methods that work iteratively starting from a few labeled seed nodes. For graphs with arbitrary compatibilities between classes,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07c541c18edf88e6cb5992b0f96b43c0
https://doi.org/10.1145/3318464.3380577
https://doi.org/10.1145/3318464.3380577
Autor:
Aristotelis Leventidis, Wolfgang Gatterbauer, Jiahui Zhang, Cody Dunne, Mirek Riedewald, H. V. Jagadish
Publikováno v:
SIGMOD Conference
Understanding the meaning of existing SQL queries is critical for code maintenance and reuse. Yet SQL can be hard to read, even for expert users or the original creator of a query. We conjecture that it is possible to capture the logical intent of qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d504692c732417b070c0653b98e084ae