Database Systems for Advanced Applications

11th International Conference, DASFAA 2006, Singapore, April 12-15, 2006, Proceedings

AvKian Lee Tan,Vilas Wuwongse

Häftad, Engelska, 2006

Del i serien Lecture Notes in Computer Science

1 124 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 11th International Conference on Database Systems for Advanced Applications, DASFAA 2006, held in Singapore in April 2006. 46 revised full papers and 16 revised short papers presented were carefully reviewed and selected from 188 submissions. Topics include sensor networks, subsequence matching and repeating patterns, spatial-temporal databases, data mining, XML compression and indexing, xpath query evaluation, uncertainty and streams, peer-to-peer and distributed networks and more.

Produktinformation

Utgivningsdatum:2006-04-05
Mått:155 x 235 x undefined mm
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:923
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540333371

Utforska kategorier

Databaser inom Data och IT

Innehållsförteckning

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 inXML 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?.