FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2048560983> ?p ?o ?g. }

• W2048560983 endingPage "2655" @default.
• W2048560983 startingPage "2626" @default.
• W2048560983 abstract "We present a new full cube computation technique and a cube storage representation approach, called the multidimensional cyclic graph (MCG) approach. The data cube relational operator has exponential complexity and therefore its materialization involves both a huge amount of memory and a substantial amount of time. Reducing the size of data cubes, without a loss of generality, thus becomes a fundamental problem. Previous approaches, such as Dwarf, Star and MDAG, have substantially reduced the cube size using graph representations. In general, they eliminate prefix redundancy and some suffix redundancy from a data cube. The MCG differs significantly from previous approaches as it completely eliminates prefix and suffix redundancies from a data cube. A data cube can be viewed as a set of sub-graphs. In general, redundant sub-graphs are quite common in a data cube, but eliminating them is a hard problem. Dwarf, Star and MDAG approaches only eliminate some specific common sub-graphs. The MCG approach efficiently eliminates all common sub-graphs from the entire cube, based on an exact sub-graph matching solution. We propose a matching function to guarantee one-to-one mapping between sub-graphs. The function is computed incrementally, in a top-down fashion, and its computation uses a minimal amount of information to generate unique results. In addition, it is computed for any measurement type: distributive, algebraic or holistic. MCG performance analysis demonstrates that MCG is 20–40% faster than Dwarf, Star and MDAG approaches when computing sparse data cubes. Dense data cubes have a small number of aggregations, so there is not enough room for runtime and memory consumption optimization, therefore the MCG approach is not useful in computing such dense cubes. The compact representation of sparse data cubes enables the MCG approach to reduce memory consumption by 70–90% when compared to the original Star approach, proposed in [33]. In the same scenarios, the improved Star approach, proposed in [34], reduces memory consumption by only 10–30%, Dwarf by 30–50% and MDAG by 40–60%, when compared to the original Star approach. The MCG is the first approach that uses an exact sub-graph matching function to reduce cube size, avoiding unnecessary aggregation, i.e. improving cube computation runtime." @default.
• W2048560983 created "2016-06-24" @default.
• W2048560983 creator A5036221107 @default.
• W2048560983 creator A5037771082 @default.
• W2048560983 date "2011-07-01" @default.
• W2048560983 modified "2023-09-25" @default.
• W2048560983 title "Multidimensional cyclic graph approach: Representing a data cube without common sub-graphs" @default.
• W2048560983 cites W1498726635 @default.
• W2048560983 cites W1523901438 @default.
• W2048560983 cites W1565838812 @default.
• W2048560983 cites W1590183325 @default.
• W2048560983 cites W2004905723 @default.
• W2048560983 cites W20077218 @default.
• W2048560983 cites W2008659587 @default.
• W2048560983 cites W2059429678 @default.
• W2048560983 cites W2078842512 @default.
• W2048560983 cites W2088873917 @default.
• W2048560983 cites W2088908211 @default.
• W2048560983 cites W2090080525 @default.
• W2048560983 cites W2092103580 @default.
• W2048560983 cites W2098376057 @default.
• W2048560983 cites W2103201239 @default.
• W2048560983 cites W2137682733 @default.
• W2048560983 cites W2143181293 @default.
• W2048560983 cites W2999873292 @default.
• W2048560983 cites W3022914912 @default.
• W2048560983 cites W3140406970 @default.
• W2048560983 cites W4241830353 @default.
• W2048560983 cites W4252578612 @default.
• W2048560983 cites W4289258943 @default.
• W2048560983 doi "https://doi.org/10.1016/j.ins.2010.05.012" @default.
• W2048560983 hasPublicationYear "2011" @default.
• W2048560983 type Work @default.
• W2048560983 sameAs 2048560983 @default.
• W2048560983 citedByCount "7" @default.
• W2048560983 countsByYear W20485609832012 @default.
• W2048560983 countsByYear W20485609832013 @default.
• W2048560983 countsByYear W20485609832015 @default.
• W2048560983 countsByYear W20485609832016 @default.
• W2048560983 countsByYear W20485609832017 @default.
• W2048560983 countsByYear W20485609832018 @default.
• W2048560983 countsByYear W20485609832023 @default.
• W2048560983 crossrefType "journal-article" @default.
• W2048560983 hasAuthorship W2048560983A5036221107 @default.
• W2048560983 hasAuthorship W2048560983A5037771082 @default.
• W2048560983 hasBestOaLocation W20485609832 @default.
• W2048560983 hasConcept C11413529 @default.
• W2048560983 hasConcept C114614502 @default.
• W2048560983 hasConcept C124101348 @default.
• W2048560983 hasConcept C162319229 @default.
• W2048560983 hasConcept C199360897 @default.
• W2048560983 hasConcept C33923547 @default.
• W2048560983 hasConcept C41008148 @default.
• W2048560983 hasConcept C53051483 @default.
• W2048560983 hasConcept C78168278 @default.
• W2048560983 hasConcept C80444323 @default.
• W2048560983 hasConceptScore W2048560983C11413529 @default.
• W2048560983 hasConceptScore W2048560983C114614502 @default.
• W2048560983 hasConceptScore W2048560983C124101348 @default.
• W2048560983 hasConceptScore W2048560983C162319229 @default.
• W2048560983 hasConceptScore W2048560983C199360897 @default.
• W2048560983 hasConceptScore W2048560983C33923547 @default.
• W2048560983 hasConceptScore W2048560983C41008148 @default.
• W2048560983 hasConceptScore W2048560983C53051483 @default.
• W2048560983 hasConceptScore W2048560983C78168278 @default.
• W2048560983 hasConceptScore W2048560983C80444323 @default.
• W2048560983 hasIssue "13" @default.
• W2048560983 hasLocation W20485609831 @default.
• W2048560983 hasLocation W20485609832 @default.
• W2048560983 hasOpenAccess W2048560983 @default.
• W2048560983 hasPrimaryLocation W20485609831 @default.
• W2048560983 hasRelatedWork W1556720194 @default.
• W2048560983 hasRelatedWork W1562184218 @default.
• W2048560983 hasRelatedWork W2062888391 @default.
• W2048560983 hasRelatedWork W2168477359 @default.
• W2048560983 hasRelatedWork W2339292744 @default.
• W2048560983 hasRelatedWork W2354773771 @default.
• W2048560983 hasRelatedWork W2360409959 @default.
• W2048560983 hasRelatedWork W2361732851 @default.
• W2048560983 hasRelatedWork W2377321178 @default.
• W2048560983 hasRelatedWork W3120311794 @default.
• W2048560983 hasVolume "181" @default.
• W2048560983 isParatext "false" @default.
• W2048560983 isRetracted "false" @default.
• W2048560983 magId "2048560983" @default.
• W2048560983 workType "article" @default.