کتاب مرجع WorldCat

download pdf D. Aegidii Hunnii. Theses De Abrogando Exorcismo Quas Paulo Ante Discessum ex hac vita Conscripsit ut de iis publice in Witebergensi Academia disputaretur, دانلود D. Aegidii Hunnii. Theses De Abrogando Exorcismo Quas Paulo Ante Discessum ex hac vita Conscripsit ut de iis publice in Witebergensi Academia disputaretur,Aegidius Hunnius; Egidius Hunn; Ägidius Hunnius; Aegidius Hunn; Egidius Hunnius; All authors, کتاب های Aegidius Hunnius; Egidius Hunn; Ägidius Hunnius; Aegidius Hunn; Egidius Hunnius; All authors,Erphordiae Wittelius Wolfenbüttel Herzog August Bibliothek Erfurt 1606, لیست کتاب های Erphordiae Wittelius Wolfenbüttel Herzog August Bibliothek Erfurt 1606,WorldCat, کتاب های WorldCat

گت بلاگز Internet Efficient Representation of Multidimensional Data over Hierarchical Domains / دانلود فایل

مشخصات کلی Efficient Representation of Multidimensional Data over Hierarchical Domains

نویسنده کتاب (Author):

Brisaboa, Nieves R.; Cerdeira Pena, Ana Belén; López López, Narciso; Navarro, Gonzalo; Penabad, Miguel R.; Silva Coira, Fernando

انتشارات (Publisher):

Springer 2016-09-21

ویرایش و نوع فایل (Edition/Format):

 Downloadable article : English

منبع (Database):

WorldCat

عنوان ژورنال (Publication):

brisaboa-n-r-cerdeira-pena-a-lopez-lopez-n-navarro-g-penabad-m-r-silva-coira-f-2016-efficient-representation-of-multidimensional-data-over-hierarchical-domains-in-inenaga-s

موضوع (Subject):

Efficient Representation       Multidimensional Data       Hierarchical Domains       View all subjects      

توضیحات خلاصه (Summary):

[Abstract] We consider the problem of representing multidimensional data where the domain of each dimension is organized hierarchically, and the queries require summary information at a different node in the hierarchy of each dimension. This is the typical case of OLAP databases. A basic approach is to represent each hierarchy as a one-dimensional line and recast the queries as multidimensional range queries. This approach can be implemented compactly by generalizing to more dimensions the k2k2 -treap, a compact representation of two-dimensional points that allows for efficient summarization queries along generic ranges. Instead, we propose a more flexible generalization, which instead of a generic quadtree-like partition of the space, follows the domain hierarchies across each dimension to organize the partitioning. The resulting structure is much more efficient than a generic multidimensional structure, since queries are resolved by aggregating much fewer nodes of the tree.  Read more…

ژانر / فرم:info:eu-repo/semantics/conferenceObject

موضوع:Internet resource

نوع منبع:Internet Resource, Article

تمام نویسندگان / همکاران: Brisaboa, Nieves R.; Cerdeira Pena, Ana Belén; López López, Narciso; Navarro, Gonzalo; Penabad, Miguel R.; Silva Coira, Fernando

شناسه OCLC:979265493

Language Note:English

فهرست محتوا:0302-9743 1611-3349 http://hdl.handle.net/2183/18175 10.1007/978-3-319-46049-9_19

نویسنده : getblogs