Sciweavers

3225 search results - page 276 / 645
» Query Optimization by Stored Queries
Sort
View
IPTPS
2003
Springer
15 years 12 months ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
APIN
2007
118views more  APIN 2007»
15 years 6 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
ICDE
2008
IEEE
175views Database» more  ICDE 2008»
16 years 8 months ago
Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has particularly addressed this que...
Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, E...
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
16 years 6 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 7 days ago
A Nested Relational Approach to Processing SQL Subqueries
One of the most powerful features of SQL is the use of nested queries. Most research work on the optimization of nested queries focuses on aggregate subqueries. However, the solut...
Bin Cao, Antonio Badia