Показват се публикациите с етикет Wikipedia The Free Encyclopedia. Показване на всички публикации

Oberhohenberg

Oberhohenberg



From Wikipedia, the free encyclopedia



































Oberhohenberg
2006-10-29DeilingenOberhohenbergSonnenstrahlen07.jpg
View over Deilingen to the Oberhohenberg
Elevation1,011 m (3,317 ft)
Location




Oberhohenberg is located in Baden-Württemberg


Oberhohenberg







The location within Baden-Württemberg
LocationBaden-Württemberg, Germany
RangeSwabian Alb
Coordinates48°09′50″N 8°45′38″ECoordinates: 48°09′50″N 8°45′38″E

The Oberhohenberg (1011 metres) is the second highest mountain of the Swabian Alb, only four metres lower than the Lemberg.

The ruins on its top derive from the year 1449, when the Castle Oberhohenberg together with the town of Hohenberg, located on the mountain's feet, were destroyed in a local feud.

 







Stub iconThis Baden-Württemberg location article is a stub. You can help Wikipedia by expanding it.





View page ratings

Rate this page

What's this?




Trustworthy






Objective






Complete






Well-written






















Gammaridea

Gammaridea



From Wikipedia, the free encyclopedia


























































Gammaridea
Gammarus roeselii
(Gammaroidea: Gammaridae)
Scientific classification
Kingdom:Animalia
Phylum:Arthropoda
Subphylum:Crustacea
Class:Malacostraca
Subclass:Eumalacostraca
Superorder:Peracarida
Order:Amphipoda
Suborder:Gammaridea
Latreille, 1802
Diversity
21 superfamilies


Gammaridea is a suborder of small, shrimp-like crustaceans in the order Amphipoda. It contains about 7,275 (92%) of the 7,900 described species of amphipods, in approximately 1,000 genera, divided among around 125 families.[1] Gammaridea includes almost all freshwater amphipods (such as Gammarus pulex), but most of its members are marine. The group may be paraphyletic,[2] and a 2003 revision by Myers and Lowry moved several families from Gammaridea to join members of the former Caprellidea in a new suborder Corophiidea.[1]

[edit]Systematics






Hirondellea gigas
(Lysianassoidea: Uristidae)








Urothoe brevicornis
(Phoxocephaloidea: Urothoidae)








Amphilochus neapolitanus
(Stenothoidea: Amphilochidae)






Superfamily Ampeliscoidea

  • Ampeliscidae


Superfamily Crangonyctoidea

  • Allocrangonyctidae

  • Artesiidae

  • Bogidiellidae

  • Crangonyctidae

  • Crymostygidae

  • Falklandellidae

  • Kotumsaridae (tentatively placed here)

  • Neoniphargidae

  • Niphargidae

  • Paracrangonyctidae

  • Paramelitidae

  • Perthiidae

  • Phreatogammaridae

  • Pseudocrangonyctidae

  • Pseudoniphargidae

  • Sternophysingidae


Superfamily Dexaminoidea

  • Atylidae

  • Dexaminidae

  • Lepechinellidae


Superfamily Eusiroidea

  • Amathillopsidae

  • Bateidae

  • Calliopiidae

  • Eusiridae

  • Gammaracanthidae

  • Gammarellidae

  • Pontogeneiidae


Superfamily Gammaroidea

  • Acanthogammaridae

  • Acanthonotozomatidae

  • Anisogammaridae

  • Baikalogammaridae

  • Behningiellidae

  • Cardenioidae

  • Caspicolidae

  • Eulimnogammaridae

  • Gammaridae

  • Gammaroporeiidae

  • Iphigenellidae

  • Macrohectopidae

  • Mesogammaridae

  • Micruropodidae

  • Pachyschesidae

  • Pallaseidae

  • Pontogammaridae

  • Typhlogammaridae


Superfamily Hadzioidea

  • Carangoliopsidae

  • Hadziidae

  • Melitidae

  • Metacrangonyctidae


Superfamily Iphimedioidea

  • Acanthonotozomellidae

  • Dikwidae

  • Epimeriidae

  • Iphimediidae

  • Ochlesidae

  • Vicmusiidae


Superfamily Kurioidea

  • Kuriidae


Superfamily Leucothoidea



Lossless-Join Decomposition

Lossless-Join Decomposition



From Wikipedia, the free encyclopedia





In computer science the concept of a Lossless-Join Decomposition is central in removing redundancy safely from databases while preserving the original data.








Contents


[hide]


  • 1 Lossless-join Decomposition

  • 2 Example

  • 3 Normal Forms

  • 4 References



[edit]Lossless-join Decomposition


Can also be called Nonadditive. If you decompose a relation R into relations R_1 and R_2 you will guarantee a Lossless-Join if R_1⋈R_2 = R.

Let R be a relation schema.

Let F be a set of functional dependencies on R.

Let R_1 and R_2 form a decomposition of R.

The decomposition is a lossless-join decomposition of R if at least one of the following functional dependencies are in F+(where F+ stands for the closure for every attribute in F):[1]

  • R_1 ∩ R_2 → R_1

  • R_1 ∩ R_2 → R_2


[edit]Example



  • Let R = (A, B, C, D) be the relation schema, with A, B, C and D attributes.

  • Let F = \{ A \rightarrow BC \} be the set of functional dependencies.

  • Decomposition into R_1 = (A, B, C) and R_2 = (A, D) is lossless under F because R_1 \cap R_2 = (A) and A \rightarrow BC so R_1 \cap R_2 \rightarrow R_1.


[edit]Normal Forms


Decomposition into BCNF or 3NF must always be lossless.

[edit]References




  1. ^ "Lossless Join Decomposition". University at Buffalo (Jan Chomicki). Retrieved 2012-02-08.





sOURCE

- Copyright © How to make this - Skyblue - Powered by Blogger - Designed by Johanes Djogan -