Sciweavers

2070 search results - page 144 / 414
» Querying Communities in Relational Databases
Sort
View
PVLDB
2008
71views more  PVLDB 2008»
14 years 10 months ago
Read-optimized databases, in depth
Recently, a number of papers have been published showing the benefits of column stores over row stores. However, the research comparing the two in an "apples-to-apples" ...
Allison L. Holloway, David J. DeWitt
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 11 months ago
Call to order: a hierarchical browsing approach to eliciting users' preference
Computing preference queries has received a lot of attention in the database community. It is common that the user is unsure of his/her preference, so care must be taken to elicit...
Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H....
MFDBS
1989
102views Database» more  MFDBS 1989»
15 years 3 months ago
Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
W. Yan, Nelson Mendonça Mattos
NAR
2011
252views Computer Vision» more  NAR 2011»
14 years 2 months ago
BISC: Binary SubComplexes in proteins database
Binary subcomplexes in proteins database (BISC) is a new protein–protein interaction (PPI) database linking up the two communities most active in their characterization: structu...
Thomas Juettemann, Dietlind L. Gerloff
VLDB
2005
ACM
121views Database» more  VLDB 2005»
15 years 4 months ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...