Sciweavers

51 search results - page 9 / 11
» Distribution Rules for Array Database Queries
Sort
View
ADBIS
2000
Springer
97views Database» more  ADBIS 2000»
13 years 11 months ago
An Efficient Storage Manager
When dealing with large quantities of clauses, the use of persistent knowledge is inevitable, and indexing methods are essential to answer queries efficiently. We introduce PerKMan...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...
VLDB
1997
ACM
97views Database» more  VLDB 1997»
13 years 10 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
ICDE
2006
IEEE
165views Database» more  ICDE 2006»
14 years 20 days ago
Privacy Preserving Clustering on Horizontally Partitioned Data
Data mining has been a popular research area for more than a decade due to its vast spectrum of applications. The power of data mining tools to extract hidden information that can...
Ali Inan, Yücel Saygin, Erkay Savas, Ay&ccedi...
ASWC
2008
Springer
13 years 8 months ago
Scalable Distributed Ontology Reasoning Using DHT-Based Partitioning
Abstract. Ontology reasoning is an indispensable step to fully exploit the implicit semantics of Semantic Web data. The inherent distribution characteristic of the Semantic Web and...
Qiming Fang, Ying Zhao, Guangwen Yang, Weimin Zhen...
ICDCS
1989
IEEE
13 years 10 months ago
Transparent Concurrent Execution of Mutually Exclusive Alternatives
We examine the task of concurrently computing alternative solutions to a problem. We restrict our interest to the case where only one of the solutions is needed; in this case we n...
Jonathan M. Smith, Gerald Q. Maguire Jr.