611 search results - page 52 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
KDD
2010
ACM
14 years 1 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
IDEAS
2008
IEEE
14 years 4 months ago
2008
IEEE
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
SIGMOD
2011
ACM
13 years 26 days ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
VLDB
2007
ACM
14 years 10 months ago
2007
ACM
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
CIKM
2007
Springer
14 years 4 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...