Sciweavers

299 search results - page 12 / 60
» On Graph Query Optimization in Large Networks
Sort
View
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 6 days ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
TCS
2008
14 years 11 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
SIGMOD
2011
ACM
297views Database» more  SIGMOD 2011»
14 years 2 months ago
Graph cube: on warehousing and OLAP multidimensional networks
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
Peixiang Zhao, Xiaolei Li, Dong Xin, Jiawei Han
ICDE
2007
IEEE
205views Database» more  ICDE 2007»
16 years 1 months ago
Multi-source Skyline Query Processing in Road Networks
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...
Ke Deng, Xiaofang Zhou, Heng Tao Shen
INFOCOM
2009
IEEE
15 years 6 months ago
Smart Trend-Traversal: A Low Delay and Energy Tag Arbitration Protocol for Large RFID Systems
—We propose a Smart Trend-Traversal (STT) protocol for RFID tag arbitration, which effectively reduces the collision overhead occurred in the arbitration process. STT, a Query Tr...
Lei Pan, Hongyi Wu