Sciweavers

721 search results - page 89 / 145
» Supporting top-k join queries in relational databases
Sort
View
WEBDB
2010
Springer
238views Database» more  WEBDB 2010»
15 years 3 months ago
An Agglomerative Query Model for Discovery in Linked Data: Semantics and Approach
Data on the Web is increasingly being used for discovery and exploratory tasks. Unlike traditional fact-finding tasks that require only the typical single-query and response parad...
Sidan Gao, Haizhou Fu, Kemafor Anyanwu
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 5 months ago
LIVE: A Lineage-Supported Versioned DBMS
Abstract— This paper presents LIVE, a complete DBMS designed for applications with many stored derived relations, and with a need for simple versioning capabilities when base dat...
Anish Das Sarma, Martin Theobald, Jennifer Widom
SIGMOD
2011
ACM
442views Database» more  SIGMOD 2011»
14 years 2 months ago
ArrayStore: a storage manager for complex parallel array processing
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
Emad Soroush, Magdalena Balazinska, Daniel L. Wang
IS
2007
14 years 11 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
INFOCOM
2003
IEEE
15 years 5 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan