Atjaunināt sīkdatņu piekrišanu

Transactions on Large-Scale Data- and Knowledge-Centered Systems XXV 1st ed. 2016 [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 187 pages, height x width: 235x155 mm, weight: 454 g, 61 Illustrations, color; IX, 187 p. 61 illus. in color., 1 Paperback / softback
  • Sērija : Transactions on Large-Scale Data- and Knowledge-Centered Systems 9620
  • Izdošanas datums: 02-Mar-2016
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3662495333
  • ISBN-13: 9783662495339
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 187 pages, height x width: 235x155 mm, weight: 454 g, 61 Illustrations, color; IX, 187 p. 61 illus. in color., 1 Paperback / softback
  • Sērija : Transactions on Large-Scale Data- and Knowledge-Centered Systems 9620
  • Izdošanas datums: 02-Mar-2016
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3662495333
  • ISBN-13: 9783662495339
This, the 25th issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, contains five fully revised selected papers focusing on data and knowledge management systems. Topics covered include a framework consisting of two heuristics with slightly different characteristics to compute the action rating of data stores, a theoretical and experimental study of filter-based equijoins in a MapReduce environment, a constraint programming approach based on constraint reasoning to study the view selection and data placement problem given a limited amount of resource, a formalization and an approximate algorithm to tackle the problem of source selection and query decomposition in federations of SPARQL endpoints, and a matcher factory enabling the generation of a dedicated schema matcher for a given schema matching scenario.

On Expedited Rating of Data Stores.- A Theoretical andExperimental Comparison of Filter-Based Equijoins in MapReduce.- ConstraintOptimization Method for Large-Scale Distributed View Selection.- On theSelection of SPARQL Endpoints to Efficiently Execute Federated SPARQL Queries.-YAM: A Step Forward for Generating a Dedicated Schema Matcher.
On Expedited Rating of Data Stores
1(32)
Sumita Barahmand
Shahram Ghandeharizadeh
A Theoretical and Experimental Comparison of Filter-Based Equijoins in MapReduce
33(38)
Thuong-Cang Phan
Laurent D'Orazio
Philippe Rigaux
A Constraint Optimization Method for Large-Scale Distributed View Selection
71(38)
Imene Mami
Zohra Bellahsene
Remi Coletta
On the Selection of SPARQL Endpoints to Efficiently Execute Federated SPARQL Queries
109(41)
Maria-Esther Vidal
Simon Castillo
Maribel Acosta
Gabriela Montoya
Guillermo Palma
YAM: A Step Forward for Generating a Dedicated Schema Matcher
150(37)
Fabien Duchateau
Zohra Bellahsene
Author Index 187