The Experts below are selected from a list of 84 Experts worldwide ranked by ideXlab platform
M. Krippendorf - One of the best experts on this subject based on the ideXlab platform.
-
DEXA Workshop - The translation of star schema into entity-relationship diagrams
Database and Expert Systems Applications. 8th International Conference DEXA '97. Proceedings, 1997Co-Authors: M. Krippendorf, Il-yeol SongAbstract:The star schema is widely accepted as an appropriate Underlying Table structure for data warehouses, but enterprise data is frequently defined in terms of entity-relationship diagrams. A key issue for data warehouse designers is how to move from legacy OLTP designs into the star schema. In this paper, we examine the semantics and constraints of the star schema in some of its different forms and translate them into analogous ERDs. These different forms include the simple, multi-star and snowflaked star schema, and several variations on facts and dimensions, such as multiple fact and outboard dimension Tables. We outline transformation rules for each case and show a series of examples. These heuristics will be useful in mapping and maintaining consistency between OLTP databases and data warehouses.
-
The Tran$~~tion of Star Sehe a into Entity-Relationship Diagrams
1997Co-Authors: M. KrippendorfAbstract:The star schema is widely accepted as an appropriate Underlying Table structure for data warehouses, but enterprise data is frequently dejned in terms of entityrelationship diagrams. A key issue for data warehouse designers is how to move from legacy OLTP designs into the star schema. In this paper, we examine the semantics and constraints of the star schema in some of its different forms and translate them into analogous ERDs. These different forms include the simple, multi-star, and snowJlaked star schema, and several variations on facts and dimensions, such as multiple fact and outboard dimension Tables. We outline transformation rules for each case and show a series of examples. These heuristics will be useful in mapping and maintaining consistency between OLTP databases and data wurehouses.
-
The translation of star schema into entity-relationship diagrams
Database and Expert Systems Applications. 8th International Conference DEXA '97. Proceedings, 1997Co-Authors: M. Krippendorf, Il-yeol SongAbstract:The star schema is widely accepted as an appropriate Underlying Table structure for data warehouses, but enterprise data is frequently defined in terms of entity-relationship diagrams. A key issue for data warehouse designers is how to move from legacy OLTP designs into the star schema. In this paper, we examine the semantics and constraints of the star schema in some of its different forms and translate them into analogous ERDs. These different forms include the simple, multi-star and snowflaked star schema, and several variations on facts and dimensions, such as multiple fact and outboard dimension Tables. We outline transformation rules for each case and show a series of examples. These heuristics will be useful in mapping and maintaining consistency between OLTP databases and data warehouses.
Il-yeol Song - One of the best experts on this subject based on the ideXlab platform.
-
DEXA Workshop - The translation of star schema into entity-relationship diagrams
Database and Expert Systems Applications. 8th International Conference DEXA '97. Proceedings, 1997Co-Authors: M. Krippendorf, Il-yeol SongAbstract:The star schema is widely accepted as an appropriate Underlying Table structure for data warehouses, but enterprise data is frequently defined in terms of entity-relationship diagrams. A key issue for data warehouse designers is how to move from legacy OLTP designs into the star schema. In this paper, we examine the semantics and constraints of the star schema in some of its different forms and translate them into analogous ERDs. These different forms include the simple, multi-star and snowflaked star schema, and several variations on facts and dimensions, such as multiple fact and outboard dimension Tables. We outline transformation rules for each case and show a series of examples. These heuristics will be useful in mapping and maintaining consistency between OLTP databases and data warehouses.
-
The translation of star schema into entity-relationship diagrams
Database and Expert Systems Applications. 8th International Conference DEXA '97. Proceedings, 1997Co-Authors: M. Krippendorf, Il-yeol SongAbstract:The star schema is widely accepted as an appropriate Underlying Table structure for data warehouses, but enterprise data is frequently defined in terms of entity-relationship diagrams. A key issue for data warehouse designers is how to move from legacy OLTP designs into the star schema. In this paper, we examine the semantics and constraints of the star schema in some of its different forms and translate them into analogous ERDs. These different forms include the simple, multi-star and snowflaked star schema, and several variations on facts and dimensions, such as multiple fact and outboard dimension Tables. We outline transformation rules for each case and show a series of examples. These heuristics will be useful in mapping and maintaining consistency between OLTP databases and data warehouses.
R. Padman - One of the best experts on this subject based on the ideXlab platform.
-
HICSS (6) - Inference of three-way Table entries from two-dimensional projections
Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998Co-Authors: S.f. Roehrig, G.t. Duncan, R. Krishnan, R. PadmanAbstract:Multi-dimensional Tables of sensitive information are often summarized and made public by means of lower-dimensional projections, which are intended do prevent any disclosure of confidential data. Multiple projections of the same Underlying Table are linked over common attributes, however, so there is concern about the possibility of recovering sensitive data by combining projections. The authors present an algorithm that gives tight upper and lower bounds on cell values of three-dimensional data when the three two-dimensional projections of that data are available.
-
Inference of three-way Table entries from two-dimensional projections
Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998Co-Authors: S.f. Roehrig, G.t. Duncan, R. Krishnan, R. PadmanAbstract:Multi-dimensional Tables of sensitive information are often summarized and made public by means of lower-dimensional projections, which are intended do prevent any disclosure of confidential data. Multiple projections of the same Underlying Table are linked over common attributes, however, so there is concern about the possibility of recovering sensitive data by combining projections. The authors present an algorithm that gives tight upper and lower bounds on cell values of three-dimensional data when the three two-dimensional projections of that data are available.
S.f. Roehrig - One of the best experts on this subject based on the ideXlab platform.
-
HICSS (6) - Inference of three-way Table entries from two-dimensional projections
Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998Co-Authors: S.f. Roehrig, G.t. Duncan, R. Krishnan, R. PadmanAbstract:Multi-dimensional Tables of sensitive information are often summarized and made public by means of lower-dimensional projections, which are intended do prevent any disclosure of confidential data. Multiple projections of the same Underlying Table are linked over common attributes, however, so there is concern about the possibility of recovering sensitive data by combining projections. The authors present an algorithm that gives tight upper and lower bounds on cell values of three-dimensional data when the three two-dimensional projections of that data are available.
-
Inference of three-way Table entries from two-dimensional projections
Proceedings of the Thirty-First Hawaii International Conference on System Sciences, 1998Co-Authors: S.f. Roehrig, G.t. Duncan, R. Krishnan, R. PadmanAbstract:Multi-dimensional Tables of sensitive information are often summarized and made public by means of lower-dimensional projections, which are intended do prevent any disclosure of confidential data. Multiple projections of the same Underlying Table are linked over common attributes, however, so there is concern about the possibility of recovering sensitive data by combining projections. The authors present an algorithm that gives tight upper and lower bounds on cell values of three-dimensional data when the three two-dimensional projections of that data are available.
Noor S. Shubear - One of the best experts on this subject based on the ideXlab platform.
-
Touch the Table before the target: contact with an Underlying surface may assist the development of precise visually controlled reach and grasp movements in human infants
Experimental Brain Research, 2018Co-Authors: Jenni M. Karl, Alexis M. Wilson, Marisa E. Bertoli, Noor S. ShubearAbstract:Multiple motor channel theory posits that skilled hand movements arise from the coordinated activation of separable neural circuits in parietofrontal cortex, each of which produces a distinct movement and responds to different sensory inputs. Prehension, the act of reaching to grasp an object, consists of at least two movements: a reach movement that transports the hand to a target location and a grasp movement that shapes and closes the hand for target acquisition. During early development, discrete pre-reach and pre-grasp movements are refined based on proprioceptive and tactile feedback, but are gradually coordinated together into a singular hand preshaping movement under feedforward visual control. The neural and behavioural factors that enable this transition are currently unknown. In an attempt to identify such factors, the present descriptive study used frame-by-frame video analysis to examine 9-, 12-, and 15-month-old infants, along with sighted and unsighted adults, as they reached to grasp small ring-shaped pieces of cereal (Cheerios) resting on a Table. Compared to sighted adults, infants and unsighted adults were more likely to make initial contact with the Underlying Table before they contacted the target. The way in which they did so was also similar in that they generally contacted the Table with the tip of the thumb and/or pinky finger, a relatively open hand, and poor reach accuracy. Despite this, infants were similar to sighted adults in that they tended to use a pincer digit, defined as the tip of the thumb or index finger, to subsequently contact the target. Only in infants was this ability related to their having made prior contact with the Underlying Table. The results are discussed in relation to the idea that initial contact with an Underlying Table or surface may assist infants in learning to use feedforward visual control to direct their digits towards a precise visual target.
