Sciweavers

57 search results - page 10 / 12
» Evaluating very large datalog queries on social networks
Sort
View
92
Voted
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 4 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
15 years 4 months ago
Optimizing joins in a map-reduce environment
Implementations of map-reduce are being used to perform many operations on very large data. We examine strategies for joining several relations in the map-reduce environment. Our ...
Foto N. Afrati, Jeffrey D. Ullman
80
Voted
PERCOM
2010
ACM
15 years 1 months ago
Ad-hoc voice-based group communication
Abstract—People waste many hours driving each day. Although unavoidable, this time can be very boring to motorists. Similar to people taking mass transit who often pass the time ...
Lu Han, Stephen Smaldone, Pravin Shankar, James Bo...
CN
2010
136views more  CN 2010»
14 years 9 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
ICDM
2009
IEEE
125views Data Mining» more  ICDM 2009»
15 years 4 months ago
A Fully Automated Method for Discovering Community Structures in High Dimensional Data
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
Jianhua Ruan