Vai al contenuto principale della pagina
Titolo: | Web-Age Information Management. WAIM 2010 Workshops [[electronic resource] ] : WAIM 2010 International Workshops: IWGD 2010, WCMT 2010, XMLDM 2010, Jiuzhaigou Valley, China, July 15-17, 2010, Revised Selected Papers / / edited by Heng Tao Shen, Jian Pei, M. Tamer Özsu, Lei Zou, Jiaheng Lu, Tok Wang Ling, Ge Yu, Yi Zhuang, Jie Shao |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Edizione: | 1st ed. 2010. |
Descrizione fisica: | 1 online resource (XXII, 260 p. 122 illus.) |
Disciplina: | 005.75 |
Soggetto topico: | Computer engineering |
Application software | |
Artificial intelligence | |
Information storage and retrieval | |
Computer communication systems | |
Database management | |
Computer Engineering | |
Information Systems Applications (incl. Internet) | |
Artificial Intelligence | |
Information Storage and Retrieval | |
Computer Communication Networks | |
Database Management | |
Soggetto geografico: | Sichuan <2010> |
Soggetto genere / forma: | Kongress. |
Persona (resp. second.): | ShenHeng Tao |
PeiJian | |
ÖzsuM. Tamer | |
ZouLei | |
LuJiaheng | |
LingTok Wang | |
YuGe | |
ZhuangYi | |
ShaoJie | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | The First International Workshop on Graph Database (IWGD 2010) -- Mining Graphs with Constraints on Symmetry and Diameter -- Graph Partitioning Strategies for Efficient BFS in Shared-Nothing Parallel Systems -- HyperGraphDB: A Generalized Graph Database -- Survey of Graph Database Performance on the HPC Scalable Graph Analysis Benchmark -- A Model for Automatic Generation of Multi-partite Graphs from Arbitrary Data -- A Fast Two-Stage Algorithm for Computing SimRank and Its Extensions -- Hotspot District Trajectory Prediction -- International Workshop on Advanced Techniques on XML Data Management (XMLDM 2010) -- Effective XML Keyword Search through Valid Lowest Information Unit -- Reducing Redundancy of XPath Query over Networks by Transmitting XML Views -- Building Web Application with XQuery -- Functional Dependencies for XML -- Structure and Content Similarity for Clustering XML Documents -- pq-Hash: An Efficient Method for Approximate XML Joins -- TwigLinkedList: Improvement of TwigList -- Compression Algorithms for Structural Query Results on XML Data -- SeCCX: Semantics-Based Fine Granular Concurrency Control for XML Data -- XRCJ: Supporting Keyword Search in XML and Relation Co-occurrence -- The 2nd International Workshop on Web-Based Contents Management Technologies (WCMT 2010) -- Formal Verification of Stochastic Timing Behavior in Web-Based Business Process Collaboration -- An Efficient Blind Ring Signature Scheme without Pairings -- Improving the Throughput of Wireless Mesh Networks for Web Services -- Author Name Disambiguation for Citations on the Deep Web -- Approximate Content Summary for Database Selection in Deep Web Data Integration -- Detecting Comment Spam through Content Analysis -- Enriching the Contents of Enterprises’ Wiki Systems with Web Information -- Query Processing with Materialized Views in a Traceable P2P Record Exchange Framework. |
Sommario/riassunto: | This book constitutes the refereed proceedings of the workshops of the 11th International Conference on Web-Age Information Management, held in Jiuzhaigou, China, in July 2010. The 25 revised full papers are organized in topical sections on three workshops: the First International Workshop on Graph Database (IWGD 2010), the First International Workshop on Advanced Techniques on XML Data Management (XMLDM 2010), and the Second International Workshop on Web-Based Contents Management Technologies (WCMT 2010). |
Titolo autorizzato: | Web-Age Information Management. WAIM 2010 Workshops |
ISBN: | 1-280-39021-2 |
9786613568137 | |
3-642-16720-9 | |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465977503316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |