Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- panelJune 2014
- abstractJune 2014
Privacy preserving social graphs for high precision community detection
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1615–1616https://doi.org/10.1145/2588555.2612668Discovering communities from a social network requires publishing the social network's data. However, community detection from raw data of a social network may reveal many sensitive information of the involved parties, e.g., how much a user is involved ...
- abstractJune 2014
PackageBuilder: querying for packages of tuples
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1613–1614https://doi.org/10.1145/2588555.2612667PackageBuilder is a system that extends query engines to support package generation. A package is a collection of tuples with certain global properties defined on the collection as a whole. In contrast to traditional query answers where each answer ...
- abstractJune 2014
EDS: a segment-based distance measure for sub-trajectory similarity search
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1609–1610https://doi.org/10.1145/2588555.2612665In this paper, we study a sub-trajectory similarity search problem which returns for a query trajectory some trajectories from the trajectory database each of which contains a sub-trajectory similar to the query trajectory. We show the insufficiency of ...
- abstractJune 2014
A user interaction based community detection algorithm for online social networks
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1607–1608https://doi.org/10.1145/2588555.2612664Existing community detection techniques either rely on content analysis or only consider the underlying structure of the social network graph, while identifying communities in online social networks (OSNs). As a result, these approaches fail to identify ...
-
- abstractJune 2014
Multi-dimensional data statistics for columnar in-memory databases
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1605–1606https://doi.org/10.1145/2588555.2612663The research presented here studies the multi-dimensional data statistics in the context of columnar in-memory database systems. Such systems, for example SAP HANA, Server Apollo, or IBM BLU, use an order-preserving dictionary with dense encoding on the ...
- abstractJune 2014
Efficient top-K SimRank-based similarity join
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1603–1604https://doi.org/10.1145/2588555.2612662SimRank is an effective and widely adopted measure to quantify the structural similarity between pairs of nodes in a graph. In this paper we study the problem of top-k SimRank-based similarity join, which finds k pairs of nodes with the largest SimRank ...
- research-articleJune 2014
Query shredding: efficient relational evaluation of queries over nested multisets
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1027–1038https://doi.org/10.1145/2588555.2612186Nested relational query languages have been explored extensively, and underlie industrial language-integrated query systems such as Microsoft's LINQ. However, relational databases do not natively support nested collections in query results. This can ...
- research-articleJune 2014
Parallel data analysis directly on scientific file formats
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 385–396https://doi.org/10.1145/2588555.2612185Scientific experiments and large-scale simulations produce massive amounts of data. Many of these scientific datasets are arrays, and are stored in file formats such as HDF5 and NetCDF. Although scientific data management systems, such as SciDB, are ...
- research-articleJune 2014
Localizing anomalous changes in time-evolving graphs
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1347–1358https://doi.org/10.1145/2588555.2612184Given a time-evolving sequence of undirected, weighted graphs, we address the problem of localizing anomalous changes in graph structure over time. In this paper, we use the term `localization' to refer to the problem of identifying abnormal changes in ...
- research-articleJune 2014
Sinew: a SQL system for multi-structured data
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 815–826https://doi.org/10.1145/2588555.2612183As applications are becoming increasingly dynamic, the notion that a schema can be created in advance for an application and remain relatively stable is becoming increasingly unrealistic. This has pushed application developers away from traditional ...
- research-articleJune 2014
EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1335–1346https://doi.org/10.1145/2588555.2612182In this paper, we present EAGr, a system for supporting large numbers of continuous neighborhood-based ("ego-centric") aggregate queries over large, highly dynamic, rapidly evolving graphs. Examples of such queries include computation of personalized, ...
- research-articleJune 2014
Local search of communities in large graphs
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 991–1002https://doi.org/10.1145/2588555.2612179Community search is important in social network analysis. For a given vertex in a graph, the goal is to find the best community the vertex belongs to. Intuitively, the best community for a given vertex should be in the vicinity of the vertex. However, ...
- research-articleJune 2014
Similarity joins for uncertain strings
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1471–1482https://doi.org/10.1145/2588555.2612178A string similarity join finds all similar string pairs between two input string collections. It is an essential operation in many applications, such as data integration and cleaning, and has been extensively studied for deterministic strings. ...
- research-articleJune 2014
Partial results in database systems
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1275–1286https://doi.org/10.1145/2588555.2612176As the size and complexity of analytic data processing systems continue to grow, the effort required to mitigate faults and performance skew has also risen. However, in some environments we have encountered, users prefer to continue query execution even ...
- research-articleJune 2014
Overlap interval partition join
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1459–1470https://doi.org/10.1145/2588555.2612175Each tuple in a valid-time relation includes an interval attribute T that represents the tuple's valid time. The overlap join between two valid-time relations determines all pairs of tuples with overlapping intervals. Although overlap joins are common, ...
- research-articleJune 2014
Histograms as a side effect of data movement for big data
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 1567–1578https://doi.org/10.1145/2588555.2612174Histograms are a crucial part of database query planning but their computation is resource-intensive. As a consequence, generating histograms on database tables is typically performed as a batch job, separately from query processing. In this paper, we ...
- research-articleJune 2014
In search of influential event organizers in online social networks
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 63–74https://doi.org/10.1145/2588555.2612173Recently, with the emergence of event-based online social services(e.g. Meetup), there have been increasing online activities to create, distribute, and organize social events. In this paper, we take the first systematic step to discover influential ...
- research-articleJune 2014
Efficient algorithms for optimal location queries in road networks
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 123–134https://doi.org/10.1145/2588555.2612172In this paper, we study the optimal location query problem based on road networks. Specifically, we have a road network on which some clients and servers are located. Each client finds the server that is closest to her for service and her cost of ...
- research-articleJune 2014
Resource-oriented approximation for frequent itemset mining from bursty data streams
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataJune 2014, Pages 205–216https://doi.org/10.1145/2588555.2612171This study considers approximation techniques for frequent itemset mining from data streams (FIM-DS) under resource constraints. In FIM-DS, a challenging problem is handling a huge combinatorial number of entries (i.e., itemsets) to be generated from ...