Sciweavers

4972 search results - page 386 / 995
» Ranking on graph data
Sort
View
ASPDAC
2011
ACM
227views Hardware» more  ASPDAC 2011»
14 years 11 months ago
Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...
Tae-ho Shin, Hyunok Oh, Soonhoi Ha
EDBT
2009
ACM
156views Database» more  EDBT 2009»
16 years 7 days ago
Secondary bitmap indexes with vertical and horizontal partitioning
Traditional bitmap indexes are utilized as a special type of primary or clustered indexes where the queries are answered by performing fast logical operations supported by hardwar...
Guadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hak...
PVLDB
2008
131views more  PVLDB 2008»
15 years 7 months ago
Learning to create data-integrating queries
The number of potentially-related data resources available for querying -- databases, data warehouses, virtual integrated schemas -continues to grow rapidly. Perhaps no area has s...
Partha Pratim Talukdar, Marie Jacob, Muhammad Salm...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
16 years 8 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
WWW
2010
ACM
16 years 28 days ago
RDF compression: basic approaches
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
Javier D. Fernández, Claudio Gutierrez, Mig...