Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Panos Parchas"'
Autor:
Nikos Armenatzoglou, Sanuj Basu, Naga Bhanoori, Mengchu Cai, Naresh Chainani, Kiran Chinta, Venkatraman Govindaraju, Todd J. Green, Monish Gupta, Sebastian Hillig, Eric Hotinger, Yan Leshinksy, Jintian Liang, Michael McCreedy, Fabian Nagel, Ippokratis Pandis, Panos Parchas, Rahul Pathak, Orestis Polychroniou, Foyzur Rahman, Gaurav Saxena, Gokul Soundararajan, Sriram Subramanian, Doug Terry
Publikováno v:
Proceedings of the 2022 International Conference on Management of Data.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c301dbe34704e8c6a930496fda61ca9d
https://doi.org/10.1145/3514221.3526045
https://doi.org/10.1145/3514221.3526045
Publikováno v:
Proceedings of the VLDB Endowment. 13:2411-2423
How should we split data among the nodes of a distributed data warehouse in order to boost performance for a forecasted workload? In this paper, we study the effect of different data partitioning schemes on the overall network cost of pairwise joins.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd4bec2dfd38953735fc3833288e38ff
https://doi.org/10.14778/3407790.3407834
https://doi.org/10.14778/3407790.3407834
Publikováno v:
ICDE
Uncertain graphs are prevalent in several applications including communications systems, biological databases and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely expensive. Sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ab7ae8cc99329aebed00ab21639404b
https://doi.org/10.1109/icde.2019.00265
https://doi.org/10.1109/icde.2019.00265
Publikováno v:
ACM Transactions on Database Systems. 40:1-39
Data in several applications can be represented as an uncertain graph whose edges are labeled with a probability of existence. Exact query processing on uncertain graphs is prohibitive for most applications, as it involves evaluation over an exponent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aad61d246e0c4f420a0ccb1603624561
https://doi.org/10.1145/2818182
https://doi.org/10.1145/2818182
Uncertain graphs are prevalent in several applications including communications systems, biological databases, and social networks. The ever increasing size of the underlying data renders both graph storage and query processing extremely expensive. S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7abbf9178edf21f7850519e14bf014f
Publikováno v:
SIGMOD Conference
Data in several applications can be represented as an uncertain graph, whose edges are labeled with a probability of existence. Exact query processing on uncertain graphs is prohibitive for most applications, as it involves evaluation over an exponen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb2ddbee76312db0860b3c7cce350321
https://doi.org/10.1145/2588555.2593668
https://doi.org/10.1145/2588555.2593668