Sciweavers

326 search results - page 33 / 66
» Parallel Query Processing in Shared Disk Database Systems
Sort
View
PDCN
2004
13 years 9 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 7 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
SIGMOD
2007
ACM
147views Database» more  SIGMOD 2007»
14 years 7 months ago
Extending relational query optimization to dynamic schemas for information integration in multidatabases
This paper extends relational processing and optimization to the FISQL/FIRA languages for dynamic schema queries over multidatabases. Dynamic schema queries involve the creation a...
Catharine M. Wyss, Felix I. Wyss
ICDE
1999
IEEE
184views Database» more  ICDE 1999»
14 years 9 months ago
Document Warehousing Based on a Multimedia Database System
Nowadays, structured data such as sales and business forms are stored in data warehouses for decision makers to use. Further, unstructured data such as emails, html texts, images,...
Hiroshi Ishikawa, Kazumi Kubota, Yasuo Noguchi, Ko...