6004 search results - page 334 / 1201 » Parallelizing query optimization |
113
Voted
EDBT
2004
ACM
16 years 28 days ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
117
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
124
click to vote
VLDB
2005
ACM
15 years 6 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
ICPP
2007
IEEE
15 years 7 months ago
2007
IEEE
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
101
click to vote
ICDCS
2002
IEEE
15 years 5 months ago
2002
IEEE
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the...