Sciweavers

1890 search results - page 122 / 378
» Querying Big Data by Accessing Small Data
Sort
View
CIKM
2010
Springer
15 years 5 months ago
Query optimization for ontology-based information integration
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
Yingjie Li, Jeff Heflin
PC
2002
114views Management» more  PC 2002»
15 years 6 months ago
Optimizing noncontiguous accesses in MPI-IO
The I/O access patterns of many parallel applications consist of accesses to a large number of small, noncontiguous pieces of data. If an application's I/O needs are met by m...
Rajeev Thakur, William Gropp, Ewing L. Lusk
DNIS
2005
Springer
112views Database» more  DNIS 2005»
15 years 12 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
VLDB
2005
ACM
115views Database» more  VLDB 2005»
15 years 12 months ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
DIWEB
2004
15 years 7 months ago
Distributed Query Processing in P2P Systems with Incomplete Schema Information
The peer-to-peer (P2P) paradigm has emerged recently, mainly by file sharing systems like Napster or Gnutella and in terms of scalable distributed data structures. Because of the d...
Marcel Karnstedt, Katja Hose, Kai-Uwe Sattler