//]]>
Item type Location Call Number Status Date Due
E-Book E-Book AUM Main Library 005.74 (Browse Shelf) Not for loan

Shortest Path Computation over Disk-Resident Large Graphs Based on Extended Bulk Synchronous Parallel Methods -- Fast SimRank Computation over Disk-Resident Graphs -- S-store: An Engine for Large RDF Graph Integrating Spatial Information -- Physical Column Organization in In-Memory Column Stores -- A Specific Encryption Solution for Data Warehouses -- NameNode and DataNode Coupling for a Power-Proportional Hadoop Distributed File System -- Mapping Entity-Attribute Web Tables to Web-Scale Knowledge Bases -- On Leveraging Crowdsourcing Techniques for Schema Matching Networks -- A Mechanism for Stream Program Performance Recovery in Resource Limited Compute Clusters -- Detecting User Preference on Microblog -- Efficient SPARQL Query Evaluation via Automatic Data Partitioning -- Searching Desktop Files Based on Access Logs -- An In-Memory/GPGPU Approach to Query Processing for Aspect-Oriented Data Management -- Parallel Triangle Counting over Large Graphs -- Document Summarization via Self-Present Sentence Relevance Model -- A Hybrid Framework for Product Normalization in Online Shopping -- A Hybrid Approach for Relational Similarity Measurement -- Susceptible-Infected- Susceptible Epidemic Model -- EntityManager: An Entity-Based Dirty Data Management System -- Similarity Joins on Item Set Collections Using Zero-Suppressed Binary Decision Diagrams -- Adaptive Query Scheduling in Key-Value Data Stores -- AVR-Tree: Speeding Up the NN and ANN Queries on Location Data -- Generalization-Based Private Indexes for Outsourced Databases -- MVP Index: Towards Efficient Known-Item Search on Large Graphs -- Continuous Topically Related Queries Grouping and Its Application on Interest Identification -- Minimizing Explanations for Missing Answers to Queries on Databases -- A Compact and Efficient Labeling Scheme for XML Documents -- History-Offset Implementation Scheme of XML Documents and Its Evaluations -- On the Complexity of t-Closeness Anonymization and Related Problems -- Distributed Anonymization for Multiple Data Providers in a Cloud System -- Feel Free to Check-in: Privacy Alert against Hidden Location Inference Attacks in GeoSNs -- Consistent Query Answering Based on Repairing Inconsistent Attributes with Nulls -- On Efficient k-Skyband Query Processing over Incomplete Data -- Mining Frequent Patterns from Uncertain Data with MapReduce for Big Data Analytics -- Efficient Probabilistic Reverse k-Nearest Neighbors Query Processing on Uncertain Data.

This two volume set LNCS 7825 and LNCS 7826 constitutes the refereed proceedings of the 18th International Conference on Database Systems for Advanced Applications, DASFAA 2013, held in Wuhan, China, in April 2013. The 51 revised full papers and 10 short papers presented together with 2 invited keynote talks, 1 invited paper, 3 industrial papers, 9 demo presentations, 4 tutorials and 1 panel paper were carefully reviewed and selected from a total of 227 submissions. The topics covered in part 1 are social networks; query processing; nearest neighbor search; index; query analysis; XML data management; privacy protection; and uncertain data management; and in part 2: graph data management; physical design; knowledge management; temporal data management; social networks; query processing; data mining; applications; and database applications.

There are no comments for this item.

Log in to your account to post a comment.

Languages: 
English |
العربية