Vor Ort
Merkzettel Warenkorb
Produktbild: Database Systems for Advanced Applications
Band 3882

Database Systems for Advanced Applications 11th International Conference, DASFAA 2006, Singapore, April 12-15, 2006, Proceedings

Aus der Reihe Information Systems and Applications, incl. Internet/Web, and HCI

93,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.04.2006

Herausgeber

Kian Lee Tan + weitere

Verlag

Springer Berlin

Seitenzahl

923

Maße (L/B/H)

24/15,7/3,7 cm

Gewicht

1367 g

Auflage

2006. 2006

Sprache

Englisch

ISBN

978-3-540-33337-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

05.04.2006

Herausgeber

Verlag

Springer Berlin

Seitenzahl

923

Maße (L/B/H)

24/15,7/3,7 cm

Gewicht

1367 g

Auflage

2006. 2006

Sprache

Englisch

ISBN

978-3-540-33337-1

Herstelleradresse

Springer Nature Customer Service Center GmbH
Europaplatz 3
69115 Heidelberg
DE
ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Database Systems for Advanced Applications
  • Keynote Addresses.- Dataspaces: A New Abstraction for Information Management.- Dissemination of Dynamic Data: Semantics, Algorithms, and Performance.- Geo-Enabled, Mobile Services—A Tale of Routes, Detours, and Dead Ends.- Sensor Networks.- Processing Multiple Aggregation Queries in Geo-Sensor Networks.- In-Network Processing of Nearest Neighbor Queries for Wireless Sensor Networks.- Associated Load Shedding Strategies for Computing Multi-joins in Sensor Networks.- Subsequence Matching and Repeating Patterns.- Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases.- DAPSS: Exact Subsequence Matching for Data Streams.- An Efficient Approach for Mining Top-K Fault-Tolerant Repeating Patterns.- Spatial-temporal Databases.- Querying Multi-granular Compact Representations.- The COST Benchmark—Comparison and Evaluation of Spatio-temporal Indexes.- Efficient Maintenance of Ephemeral Data.- Data Mining.- Mining Outliers in Spatial Networks.- Summarizing Frequent Patterns Using Profiles.- Mining Spatio-temporal Association Rules, Sources, Sinks, Stationary Regions and Thoroughfares in Object Mobility Databases.- XML Compression and Indexing.- Document Decomposition for XML Compression: A Heuristic Approach.- An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data.- Adaptively Indexing Dynamic XML.- XPath Query Evaluation.- TwigStackList ¬: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data.- Efficient Schemes of Executing Star Operators in XPath Query Expressions.- Exploit Sequencing to Accelerate XML Twig Query Answering.- Uncertainty and Streams.- Probabilistic Similarity Join on Uncertain Data.- Handling Uncertainty and Ignorance in Databases: A Rule to Combine Dependent Data.- PMJoin: Optimizing Distributed Multi-way Stream Joins by Stream Partitioning.- Peer-to-Peer and Distributed Networks.- Clustering Peers Based on Contents for Efficient Similarity Search.- Optimizing Peer Virtualization and Load Balancing.- Distributed Network Querying with Bounded Approximate Caching.- Performance and Authentication.- Type-Level Access Pattern View: A Technique for Enhancing Prefetching Performance.- The Dynamic Sweep Scheme Using Slack Time in the Zoned Disk.- Authentication of Outsourced Databases Using Signature Aggregation and Chaining.- XML Query Processing.- A Practitioner’s Approach to Normalizing XQuery Expressions.- Hidden Conditioned Homomorphism for XPath Fragment Containment.- Efficient Query Processing for Streamed XML Fragments.- OLAP and Data Warehouse.- An Efficient Algorithm for Computing Range-Groupby Queries.- Ag-Tree: A Novel Structure for Range Queries in Data Warehouse Environments.- An XML Document Warehouse Model.- Web and Web Services.- An Evaluation of Concurrency Control Protocols for Web Services Oriented E-Commerce.- COWES: Clustering Web Users Based on Historical Web Sessions.- A Precise Metric for Measuring How Much Web Pages Change.- Query Processing.- Similarity Search in Transaction Databases with a Two-Level Bounding Mechanism.- RAF: An Activation Framework for Refining Similarity Queries Using Learning Techniques.- Query Optimization for a Graph Database with Visual Queries.- Design: Modeling and Dependencies.- A Four Dimensional Petri Net Approach for Workflow Management.- Containment of Conjunctive Queries over Conceptual Schemata.- Data Tables with Similarity Relations: Functional Dependencies, Complete Rules and Non-redundant Bases.- Labeling Scheme and Graph Queries in XML.- Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes.- Fast Reachability Query Processing.- Document Retrieval.- Relation-Based Document Retrieval for Biomedical Literature Databases.- Effective Keyword Search in XML Documents Based on MIU.- Industrial Papers.- Assessing the Completeness of Sensor Data.- Intelligent Statistics Management in Sybase ASE 15.0.- Holistic Schema Mappings for XML-on-RDBMS.- Short Papers.- Semi-supervised Classification Based on Smooth Graphs.- Compacting XML Data.- Fast Structural Join with a Location Function.- Adapting Prime Number Labeling Scheme for Directed Acyclic Graphs.- KEYNOTE: Keyword Search by Node Selection for Text Retrieval on DHT-Based P2P Networks.- How to BLAST Your Database — A Study of Stored Procedures for BLAST Searches.- DTD-Diff: A Change Detection Algorithm for DTDs.- Mining Models of Composite Web Services for Performance Analysis.- Modeling Multimedia Data Semantics with MADS.- STIL: An Extended Resource Description Framework and an Advanced Query Language for Metadatabases.- Communication-Efficient Implementation of Range-Joins in Sensor Networks.- Efficient k-Nearest Neighbor Searches for Parallel Multidimensional Index Structures.- Efficient Non-Blocking Top-k Query Processing in Distributed Networks.- Continuous Expansion: Efficient Processing of Continuous Range Monitoring in Mobile Environments.- Effective Low-Latency K-Nearest Neighbor Search Via Wireless Data Broadcast.- Nearest Neighbor Queries for R-Trees: Why Not Bottom-Up?.