Sciweavers

516 search results - page 10 / 104
» Processing Queries in a Large Peer-to-Peer System
Sort
View
SIGMOD
2008
ACM
126views Database» more  SIGMOD 2008»
14 years 7 months ago
On efficient top-k query processing in highly distributed environments
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most ...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
VLDB
1997
ACM
141views Database» more  VLDB 1997»
13 years 11 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 7 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
JIPS
2008
112views more  JIPS 2008»
13 years 7 months ago
Two-Tier Storage DBMS for High-Performance Query Processing
: This paper describes the design and implementation of a two-tier DBMS for handling massive data and providing faster response time. In the present day, the main requirements of D...
Sang Hun Eo, Yan Li, Ho Seok Kim, Hae-Young Bae
ITCC
2003
IEEE
14 years 26 days ago
A Method for Calculating Term Similarity on Large Document Collections
We present an efficient algorithm called the Quadtree Heuristic for identifying a list of similar terms for each unique term in a large document collection. Term similarity is de...
Wolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva