Sciweavers

76 search results - page 12 / 16
» Efficient aggregation for graph summarization
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
15 years 10 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
ICCS
1998
Springer
15 years 2 months ago
Handling Specification Knowledge Evolution Using Context Lattices
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
Aldo de Moor, Guy W. Mineau
AMW
2009
14 years 11 months ago
Consistent Query Answering in Data Warehouses
Abstract. A Data Warehouse (DW) is a data repository that organizes and physically integrates data from multiple sources under special kinds of schemas. A DW is composed by a set o...
Leopoldo E. Bertossi, Loreto Bravo, Mónica ...
VLDB
1994
ACM
118views Database» more  VLDB 1994»
15 years 1 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
15 years 10 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...