Database Systems for Advanced Applications
Editat de Hiroyuki Kitagawa, Yoshiharu Ishikawa, Wenjie Li, Chiemi Watanabeen Limba Engleză Paperback – 18 mar 2010
Preț: 643.34 lei
Preț vechi: 804.18 lei
-20%
Puncte Express: 965
Carte tipărită la comandă
Livrare economică 11-25 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783642120251
ISBN-10: 3642120253
Pagini: 680
Ilustrații: XXVIII, 646 p.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 1.01 kg
Ediția:2010
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642120253
Pagini: 680
Ilustrații: XXVIII, 646 p.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 1.01 kg
Ediția:2010
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Keynote Talks.- Knowledge on the Web: Robust and Scalable Harvesting of Entity-Relationship Facts.- Cloud Data Management @ Yahoo!.- P2P-Based Technologies.- Distributed Cache Indexing for Efficient Subspace Skyline Computation in P2P Networks.- iDISQUE: Tuning High-Dimensional Similarity Queries in DHT Networks.- Adaptive Ensemble Classification in P2P Networks.- Data Mining Technologies.- Mining Rare Association Rules in the Datasets with Widely Varying Items’ Frequencies.- CAMLS: A Constraint-Based Apriori Algorithm for Mining Long Sequences.- PGP-mc: Towards a Multicore Parallel Approach for Mining Gradual Patterns.- Generalised Rule Mining.- XML Search and Matching.- An Effective Object-Level XML Keyword Search.- Effectively Inferring the Search-for Node Type in XML Keyword Search.- Matching Top-k Answers of Twig Patterns in Probabilistic XML.- Graphs.- NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs.- Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain Graphs.- Discovering Burst Areas in Fast Evolving Graphs.- Spatial Databases.- Answering Top-k Similar Region Queries.- Efficient Approximate Visibility Query in Large Dynamic Environments.- The Objects Interaction Matrix for Modeling Cardinal Directions in Spatial Databases.- Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries.- XML Technologies.- Chasing Tree Patterns under Recursive DTDs.- Efficient Label Encoding for Range-Based Dynamic XML Labeling Schemes.- An Efficient Parallel PathStack Algorithm for Processing XML Twig Queries on Multi-core Systems.- Keyword Search on Hybrid XML-Relational Databases Using XRjoin.- Efficient Database-Driven Evaluation of Security Clearance for Federated AccessControl of Dynamic XML Documents.- Time Series and Streams.- Speeding Up Complex Video Copy Detection Queries.- Efficient Skyline Maintenance for Streaming Data with Partially-Ordered Domains.- A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm.- Detecting Leaders from Correlated Time Series.- Advanced Data Mining.- Mining Outliers with Ensemble of Heterogeneous Detectors on Random Subspaces.- Mining Diversity on Networks.- Mining Regular Patterns in Data Streams.- Query Processing.- k-ARQ: k-Anonymous Ranking Queries.- QSQL: Incorporating Logic-Based Retrieval Conditions into SQL.- k-Selection Query over Uncertain Data.- Web.- Analysis of Implicit Relations on Wikipedia: Measuring Strength through Mining Elucidatory Objects.- Summarizing and Extracting Online Public Opinion from Blog Search Results.- Cloud as Virtual Databases: Bridging Private Databases and Web Services.- Temporal Top-k Search in Social Tagging Sites Using Multiple Social Networks.- Sensor Networks and Communications.- Air-Indexing on Error Prone Communication Channels.- Content-Based Multipath Routing for Sensor Networks.- Evaluating Continuous Probabilistic Queries Over Imprecise Sensor Data.- Information Management.- BPMN Process Views Construction.- Active Duplicate Detection.- FlexTable: Using a Dynamic Relation Model to Store RDF Data.- Communities and Web Graphs.- An MDL Approach to Efficiently Discover Communities in Bipartite Network.- Fires on the Web: Towards Efficient Exploring Historical Web Graphs.- Identifying Community Structures in Networks with Seed Expansion.- Dynamic Agglomerative-Divisive Clustering of Clickthrough Data for Collaborative Web Search.
Caracteristici
Fast track conference proceedings State of the art research Unique visibility