8953 search results - page 266 / 1791 » Parallel Query Processing |
137
Voted
IPPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Peer-to-Peer (P2P) networks have proven to be an efficient and successful mechanism for file sharing over the Internet. However, current P2P protocols have long worst case query...
135
click to vote
SCCC
1997
IEEE
15 years 7 months ago
1997
IEEE
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
130
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
We present the application of customized code generation to database query evaluation. The idea is to use a collection of highly efficient code templates and dynamically instantiat...
127
click to vote
DEXA
2005
Springer
15 years 8 months ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
128
click to vote
BNCOD
2003
15 years 4 months ago
2003
In this paper we describe a query paradigm based on ontologies, aggregate table-driven querying and expansion of QBE. It has two novel features: visually specifying aggregate table...