Sciweavers

1286 search results - page 217 / 258
» Scalable Package Queries in Relational Database Systems
Sort
View
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
15 years 9 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 9 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
CIKM
2006
Springer
15 years 1 months ago
Cache-oblivious nested-loop joins
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
Bingsheng He, Qiong Luo
SIGCOMM
2012
ACM
13 years 4 days ago
HyperDex: a distributed, searchable key-value store
Distributed key-value stores are now a standard component of high-performance web services and cloud computing applications. While key-value stores offer significant performance...
Robert Escriva, Bernard Wong, Emin Gün Sirer
EXPDB
2006
ACM
15 years 3 months ago
Pushing XPath Accelerator to its Limits
Two competing encoding concepts are known to scale well with growing amounts of XML data: XPath Accelerator encoding implemented by MonetDB for in-memory documents and X-Hive’s ...
Christian Grün, Alexander Holupirek, Marc Kra...