000 07830nam a22006615i 4500
001 978-3-540-33338-8
003 DE-He213
005 20240730193220.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540333388
_9978-3-540-33338-8
024 7 _a10.1007/11733836
_2doi
050 4 _aQA76.9.D35
050 4 _aQ350-390
072 7 _aUMB
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM021000
_2bisacsh
072 7 _aUMB
_2thema
072 7 _aGPF
_2thema
082 0 4 _a005.73
_223
082 0 4 _a003.54
_223
245 1 0 _aDatabase Systems for Advanced Applications
_h[electronic resource] :
_b11th International Conference, DASFAA 2006, Singapore, April 12-15, 2006, Proceedings /
_cedited by Kian Lee Tan, Vilas Wuwongse.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXIX, 923 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aInformation Systems and Applications, incl. Internet/Web, and HCI,
_x2946-1642 ;
_v3882
505 0 _aKeynote 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?.
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aDatabase management.
_93157
650 0 _aInformation storage and retrieval systems.
_922213
650 0 _aApplication software.
_9152902
650 0 _aUser interfaces (Computer systems).
_911681
650 0 _aHuman-computer interaction.
_96196
650 1 4 _aData Structures and Information Theory.
_931923
650 2 4 _aDatabase Management.
_93157
650 2 4 _aInformation Storage and Retrieval.
_923927
650 2 4 _aComputer and Information Systems Applications.
_9152903
650 2 4 _aUser Interfaces and Human Computer Interaction.
_931632
700 1 _aTan, Kian Lee.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152904
700 1 _aWuwongse, Vilas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9152905
710 2 _aSpringerLink (Online service)
_9152906
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540333371
776 0 8 _iPrinted edition:
_z9783540822530
830 0 _aInformation Systems and Applications, incl. Internet/Web, and HCI,
_x2946-1642 ;
_v3882
_9152907
856 4 0 _uhttps://doi.org/10.1007/11733836
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94652
_d94652