Managing and Mining Graph Data
velj 2010. · Advances in Database Systems · Springer Science & Business Media
4,0star
2 recenzijereport
E-knjiga
600
str.
reportOcjene i recenzije nisu potvrđene Saznajte više
O ovoj e-knjizi
Managing and Mining Graph Data is a comprehensive survey book in graph management and mining. It contains extensive surveys on a variety of important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by well known researchers in the field, and provide a broad perspective of the area. This is the first comprehensive survey book in the emerging topic of graph data processing.
Managing and Mining Graph Data is designed for a varied audience composed of professors, researchers and practitioners in industry. This volume is also suitable as a reference book for advanced-level database students in computer science and engineering.
Managing and Mining Graph Data is designed for a varied audience composed of professors, researchers and practitioners in industry. This volume is also suitable as a reference book for advanced-level database students in computer science and engineering.
Ocjene i recenzije
4,0
2 recenzije
Ocijenite ovu e-knjigu
Recite nam što mislite.
Informacije o čitanju
Pametni telefoni i tableti
Instalirajte aplikaciju Google Play knjige za Android i iPad/iPhone. Automatski se sinkronizira s vašim računom i omogućuje vam da čitate online ili offline gdje god bili.
Prijenosna i stolna računala
Audioknjige kupljene na Google Playu možete slušati pomoću web-preglednika na računalu.
Elektronički čitači i ostali uređaji
Za čitanje na uređajima s elektroničkom tintom, kao što su Kobo e-čitači, trebate preuzeti datoteku i prenijeti je na svoj uređaj. Slijedite detaljne upute u centru za pomoć za prijenos datoteka na podržane e-čitače.
