icde 2016 论文列表
32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016.
|
Scalable online betweenness centrality in evolving graphs.
Joint search by social and spatial proximity.
Top-k spatio-textual similarity join.
Fast best-effort search on graphs with multiple attributes.
kNNVWC: An efficient k-nearest neighbours approach based on Various-Widths Clustering.
XACML policy evaluation with dynamic context handling.
The prediction of venture capital co-investment based on structural balance theory.
Location aware keyword query suggestion based on document proximity.
Differentially private frequent itemset mining via transaction splitting.
Reputation aggregation in peer-to-peer network using differential gossip algorithm.
Change-point detection in a sequence of bags-of-data.
Similar subtree search using extended tree inclusion.
Capacity-Constrained Network-Voronoi Diagram.
Application sensitive energy management framework for storage systems.
Understanding short texts through semantic enrichment and hashing.
A framework for enabling user preference profiling through Wi-Fi logs.
Time-series classification with COTE: The collective of transformation-based ensembles.
CrowdOp: Query optimization for declarative crowdsourcing systems.
Improving accuracy and robustness of self-tuning histograms by subspace clustering.
Efficient probabilistic supergraph search.
App relationship calculation: An iterative process.
Indexing evolving events from tweet streams.
Crawling hidden objects with kNN queries.
TrGraph: Cross-network transfer learning via common signature subgraphs.
Structure-preserving subgraph query services.
Maximizing a record's standing in a relation.
Scalable algorithms for nearest-neighbor joins on big trajectory data.
Unsupervised ranking of multi-attribute objects based on principal curves.
Beyond millisecond latency kNN search on commodity machine.
Enabling scalable geographic service sharing with weighted imprecise Voronoi cells.
Anonymizing collections of tree-structured data.
A practical and effective sampling selection strategy for large scale deduplication.
Efficient enforcement of action-aware purpose-based access control within relational database management systems.
Metric all-k-nearest-neighbor search.
Diversified hidden Markov models for sequential labeling.
Geo-Social K-Cover Group queries for collaborative spatial computing.
Pattern-aided regression modeling and prediction model analysis.
Mining temporal patterns in interval-based data.
DSP-CC: I/O efficient parallel computation of connected components in billion-scale networks.
Subspace based network community detection using sparse linear coding.
Top-k dominating queries on incomplete data.
Safe distribution and parallel execution of data-centric workflows over the publish/subscribe abstraction.
Efficient top-k retrieval on massive data.
Querying knowledge Graphs By Example entity tuples.
Accelerated Continuous Conditional Random Fields for load forecasting.
Distributed in-memory processing of All K Nearest Neighbor queries.
Reverse keyword search for spatio-textual top-k queries in location-based services.
Virtual denormalization via array index reference for main memory OLAP.
Incremental semi-supervised clustering ensemble for high dimensional data clustering.
i2MapReduce: Incremental mapreduce for mining evolving big data.
Association discovery in two-view data.
CloudKeyBank: Privacy and owner authorization enforced key management framework.
Efficient answering of why-not questions in similar graph matching.
Joint structure feature exploration and regularization for multi-task graph classification.
CRoM and HuspExt: Improving efficiency of high utility sequential pattern extraction.
Privacy-preserving indoor localization on smartphones.
Semantic-aware blocking for entity resolution.
Domain-sensitive Recommendation with user-item subgroup analysis.
t-closeness through microaggregation: Strict privacy with enhanced utility preservation.
TRIP: An interactive retrieving-inferring data imputation approach.
Tensor canonical correlation analysis for multi-view dimension reduction.
NATERGM: A model for examining the role of Nodal Attributes in dynamic social media networks.
Efficient similarity join based on Earth Mover's Distance using MapReduce.
Adaptive noise immune cluster ensemble using affinity propagation.
Crowdsourcing for top-K query processing over uncertain data.
Using Memetic Algorithm for instance coreference resolution.
Similarity Group-By operators for multi-dimensional relational data.
Big data quality - whose problem is it?
Dark Data: Are we solving the right problems?
Microblogs data management and analysis.
Blocking for large-scale Entity Resolution: Challenges, algorithms, and practical examples.
Data profiling.
Accelerating database workloads by software-hardware-system co-design.
The era of Big Spatial Data.
Scalable data management: NoSQL data stores in research and practice.
Scaling up truth discovery.
Indoor data management.
A demonstration of GeoSpark: A cluster computing framework for processing big spatial data.
Cruncher: Distributed in-memory processing for location-based services.
DebEAQ - debugging empty-answer queries on large data graphs.
WatCA: The Waterloo consistency analyzer.
Flexible hybrid stores: Constraint-based rewriting to the rescue.
Java2SDG: Stateful big data processing for the masses.
Leveraging non-volatile memory for instant restarts of in-memory database systems.
TemProRA: Top-k temporal-probabilistic results analysis.
ORLF: A flexible framework for online record linkage and fusion.
Mercury: Metro density prediction with recurrent neural network on streaming CDR data.
A new privacy-preserving solution for clustering massively distributed personal times-series.
ANALOC: Efficient analytics over Location Based Services.
InVerDa - co-existing schema versions made foolproof.
QPlain: Query by explanation.
Ranking support for matched patterns over complex event streams: The CEPR system.
SEED: A system for entity exploration and debugging in large-scale knowledge graphs.
QB2OLAP: Enabling OLAP on Statistical Linked Open Data.
graphVizdb: A scalable platform for interactive large graph visualization.
INSQ: An influential neighbor set based moving kNN query processing system.
OptImatch: Semantic web system for query problem determination.
Beat the DIVa - decentralized identity validation for online social networks.
A query system for social media signals.
ALEX: Automatic Link Exploration in Linked Data.
Virtual lightweight snapshots for consistent analytics in NoSQL stores.
Fault-tolerant real-time analytics with distributed Oracle Database In-memory.
A column store engine for real-time streaming analytics.
FastFunction: Replacing a herd of lemmings with a cheetah a ruby framework for interaction with PostgreSQL databases.
Using SSDs to scale up Google Fusion Tables, a database-in-the-cloud.
GARNET: A holistic system approach for trending queries in microblogs.
SPDO: High-throughput road distance computations on Spark using Distance Oracles.
Recommendations meet web browsing: enhancing collaborative filtering using internet browsing logs.
Personal recommendation using deep recurrent neural networks in NetEase.
Moolle: Fan-out control for scalable distributed data stores.
Flow-Join: Adaptive skew handling for distributed joins over high-speed networks.
SQL-SA for big data discovery polymorphic and parallelizable SQL user-defined scalar and aggregate infrastructure in Teradata Aster 6.20.
A novel fast and memory efficient parallel MLCS algorithm for long and large-scale sequences alignments.
Fast motif discovery in short sequences.
Joint repairs for web wrappers.
DataXFormer: A robust transformation discovery system.
Indexing multi-metric data.
Efficiently computing reverse k furthest neighbors.
An interval join optimized for modern hardware.
A GPU-based index to support interactive spatio-temporal queries over historical data.
TOPIC: Toward perfect Influence Graph Summarization.
SLR: A scalable latent role model for attribute completion and tie prediction in social networks.
Minfer: A method of inferring motif statistics from sampled edges.
Edge classification in networks.
Incremental updates on compressed XML.
Discovering Neighborhood Pattern Queries by sample answers in knowledge base.
Learning to query: Focused web page harvesting for entity aspects.
Fast top-k search in knowledge graphs.
Automatic user identification method across heterogeneous mobility data sources.
Reverse nearest neighbor heat maps: A tool for influence exploration.
SPORE: A sequential personalized spatial item recommender system.
Discovering interpretable geo-social communities for user behavior prediction.
Event regularity and irregularity in a time unit.
ClEveR: Clustering events with high density of true-to-false occurrence ratio.
Interactive data exploration with smart drill-down.
Learning abstract snippet detectors with Temporal embedding in convolutional neural Networks.
Crowdsourcing-based real-time urban traffic speed estimation: From trends to speeds.
Keyword-aware continuous kNN query on road networks.
Fuzzy trajectory linking.
Distributed low rank approximation of implicit functions of a matrix.
2PCP: Two-phase CP decomposition for billion-scale dense tensors.
Topology-aware optimization of big sparse matrices and matrix multiplications on main-memory systems.
SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries.
OLAP over probabilistic data cubes I: Aggregating, materializing, and querying.
CLEAR: Clustering based on locality embedding and reconstruction.
Analyzing data-centric applications: Why, what-if, and how-to.
Answering why-not questions on metric probabilistic range queries.
Visualization-aware sampling for very large databases.
Collaborative analytics for data silos.
MuVE: Efficient Multi-Objective View Recommendation for Visual Data Exploration.
The CRO kernel: Using Concomitant Rank Order hashes for sparse high dimensional randomized feature maps.
Influence based cost optimization on user preference.
Answering why-not spatial keyword top-k queries via keyword adaption.
Finding the minimum spatial keyword cover.
TRANSFORMERS: Robust spatial joins on non-uniform data distributions.
PurTreeClust: A purchase tree clustering algorithm for large-scale customer transaction data.
Accelerating large scale centroid-based clustering with locality sensitive hashing.
Streaming spectral clustering.
A model-based approach for text clustering with outlier detection.
Efficient fault-tolerance for iterative graph processing on distributed dataflow systems.
HadoopViz: A MapReduce framework for extensible visualization of big spatial data.
When two choices are not enough: Balancing at scale in Distributed Stream Processing.
Input selection for fast feature engineering.
SimRank computation on uncertain graphs.
Link prediction in graph streams.
Durable graph pattern queries on historical graphs.
Spatial influence - measuring followship in the real world.
Tolerating correlated failures in Massively Parallel Stream Processing Engines.
Context-aware advertisement recommendation for high-speed social news feeding.
Quality-driven disorder handling for m-way sliding window stream joins.
Efficient handling of concept drift and concept evolution over Stream Data.
HAWK: Hardware support for unstructured log processing.
ICE: Managing cold state for big data applications.
On main-memory flushing in microblogs data management systems.
Self-Adaptive Linear Hashing for solid state drives.
Mining social ties beyond homophily.
NXgraph: An efficient graph processing system on a single machine.
Cross-layer betweenness centrality in multiplex networks with applications.
An embedding approach to anomaly detection.
Practical privacy-preserving user profile matching in social networks.
Practical private shortest path computation based on Oblivious Storage.
"Told you i didn't like it": Exploiting uninteresting items for effective collaborative filtering.
Authentication of function queries.
Platform-independent robust query processing.
Load balancing and skew resilience for parallel joins.
A novel, low-latency algorithm for multiple Group-By query optimization.
Private spatial data aggregation in the local setting.
Semantic proximity search on graphs with metagraph-based learning.
CSI_GED: An efficient approach for graph edit similarity computation.
pSCAN: Fast and exact structural graph clustering.
Being prepared in a sparse world: The case of KNN graph construction.
Differentially private frequent subgraph mining.
Optimizing secure classification performance with privacy-aware feature selection.
Differentially private multi-party high-dimensional data publishing.
Towards Virtual Private NoSQL datastores.
NoSE: Schema design for NoSQL applications.
Hobbes3: Dynamic generation of variable-length signatures for efficient approximate subsequence mappings.
Scalable supergraph search in large graph databases.
Reachability and time-based path queries in temporal graphs.
I/O efficient Core Graph Decomposition at web scale.
Planar: Parallel lightweight architecture-aware adaptive graph repartitioning.
Compressing graphs by grammars.
VColor: A practical vertex-cut based approach for coloring large graphs.
Computing Connected Components with linear communication cost in pregel-like systems.
Mutual benefit aware task assignment in a bipartite labor market.
Crowdsourced POI labelling: Location-aware result inference and Task Assignment.
Online mobile Micro-Task Allocation in spatial crowdsourcing.
Revenue maximization by viral marketing: A social network host's perspective.
BlackHole: Robust community detection inspired by graph drawing.
Topical influence modeling via topic-level interests and interactions on social curation services.
Distance-aware influence maximization in geo-social network.
Message from the ICDE 2016 Program Committee and general chairs.
