Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Nicola Onose"'
Autor:
Yasser Altowim, Khurram Faraaz, Vinayak Borkar, Sattam Alsubaiee, Pouria Pirzadeh, Ji Mahn Ok, Yingyi Bu, Zachary Heilbron, Michael J. Carey, Guangqiang Li, Young-Seok Kim, Vassilis J. Tsotras, Madhusudan Cheelangi, Jian Wen, Chen Li, Till Westmann, Raman Grover, Rares Vernica, Eugenia Gabrielova, Nicola Onose, Hotham Altwaijry, Alexander Behm, Inci Cetindil
Publikováno v:
Proceedings of the VLDB Endowment. 7:1905-1916
AsterixDB is a new, full-function BDMS (Big Data Management System) with a feature set that distinguishes it from other platforms in today's open source Big Data ecosystem. Its features make it well-suited to applications like web data warehousing, s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e31eb2cd6e04526589725e10adadee97
https://doi.org/10.14778/2733085.2733096
https://doi.org/10.14778/2733085.2733096
Autor:
Alexander Behm, Raman Grover, Young-Seok Kim, Yasser Altowim, Nicola Onose, Jian Wen, Michael J. Carey, Pouria Pirzadeh, Yingyi Bu, Zachary Heilbron, Hotham Altwaijry, Chen Li, Vinayak Borkar, Sattam Alsubaiee, Rares Vernica
Publikováno v:
Proceedings of the VLDB Endowment. 5:1898-1901
At UC Irvine, we are building a next generation parallel database system, called ASTERIX, as our approach to addressing today's "Big Data" management challenges. ASTERIX aims to combine time-tested principles from parallel database systems with those
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acf6682e88a8b26a209a3cdac5b370c5
https://doi.org/10.14778/2367502.2367532
https://doi.org/10.14778/2367502.2367532
Publikováno v:
Communications of the ACM. 55:86-97
Exploring the technology trends in basic, integrated, and cloud data services.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ee9d2681421aab47cffef81a2aff27e
https://doi.org/10.1145/2184319.2184340
https://doi.org/10.1145/2184319.2184340
Autor:
Alin Deutsch, Nicola Onose, Alexander Behm, Michael J. Carey, Yannis Papakonstantinou, Vinayak Borkar, Chen Li, Raman Grover, Rares Vernica, Vassilis J. Tsotras
Publikováno v:
Distributed and Parallel Databases. 29:185-216
ASTERIX is a new data-intensive storage and computing platform project spanning UC Irvine, UC Riverside, and UC San Diego. In this paper we provide an overview of the ASTERIX project, starting with its main goal--the storage and analysis of data pert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06f9cc0b4ec5441eb4b4faae0d3f6087
https://doi.org/10.1007/s10619-011-7082-y
https://doi.org/10.1007/s10619-011-7082-y
Publikováno v:
ACM Transactions on Database Systems. 36:1-42
We study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such familie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6feb31cc3f7f1aefa949de996c92d7ef
https://doi.org/10.1145/1929934.1929939
https://doi.org/10.1145/1929934.1929939
Autor:
Nicola Onose, Vinayak Borkar, Michael J. Carey, Pouria Pirzadeh, Till Westmann, Yingyi Bu, E. Preston Carman, Vassilis J. Tsotras
Publikováno v:
SoCC
A number of high-level query languages, such as Hive, Pig, Flume, and Jaql, have been developed in recent years to increase analyst productivity when processing and analyzing very large datasets. The implementation of each of these languages includes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a765ce4b6c477ba4e1a44ff5c5646b7b
https://doi.org/10.1145/2806777.2806941
https://doi.org/10.1145/2806777.2806941
Publikováno v:
ICDE
Hyracks is a new partitioned-parallel software platform designed to run data-intensive computations on large shared-nothing clusters of computers. Hyracks allows users to express a computation as a DAG of data operators and connectors. Operators oper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23956b3c5bd8b1eaf388029a06557d56
https://doi.org/10.1109/icde.2011.5767921
https://doi.org/10.1109/icde.2011.5767921
Autor:
Tianyi Wu, Mihai Lupu, Ioana Manolescu, G. Gou, Pierre Senellart, D. Laurent, Panos Kalnis, Jianlin Feng, Stefan Manegold, V. Sans, Christopher Ré, Konstantinos Karanasos, Dennis Shasha, Nicola Onose, Marios Hadjieleftheriou, L. Afanasiev, Stavros Harizopoulos
Publikováno v:
ACM SIGMOD Record, 38(3), 40-43
Currently submitted for publication to the ACM SIGMOD Record (to appear before the end of 2009); This paper reports on the SIGMOD 2009 Repeatability and Workability initiative, an effort to verify the experiments presented in articles accepted to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aab4e8a13bc2f2aa2fc49bbef9af222b
https://hal.inria.fr/inria-00433458
https://hal.inria.fr/inria-00433458
Publikováno v:
ICDT
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of queries. We revisit a classical setting in which the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f0293700c2e0678c2223d59cb036e92
https://doi.org/10.1145/1514894.1514905
https://doi.org/10.1145/1514894.1514905
We study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such familie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fbcb6e9e11911a0b237b9265036c144
https://escholarship.org/uc/item/0zm0n95m
https://escholarship.org/uc/item/0zm0n95m