Sciweavers

1782 search results - page 267 / 357
» Processing Queries over Distributed XML Databases
Sort
View
SIGMOD
2006
ACM
106views Database» more  SIGMOD 2006»
14 years 9 months ago
Run-time operator state spilling for memory intensive long-running queries
Main memory is a critical resource when processing longrunning queries over data streams with state intensive operators. In this work, we investigate state spill strategies that h...
Bin Liu, Yali Zhu, Elke A. Rundensteiner
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
14 years 1 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
CEC
2008
IEEE
14 years 3 months ago
Distributed multi-relational data mining based on genetic algorithm
—An efficient algorithm for mining important association rule from multi-relational database using distributed mining ideas. Most existing data mining approaches look for rules i...
Wenxiang Dou, Jinglu Hu, Kotaro Hirasawa, Gengfeng...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 11 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
DBISP2P
2005
Springer
172views Database» more  DBISP2P 2005»
14 years 2 months ago
A Content-Addressable Network for Similarity Search in Metric Spaces
In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content– addressable Network (CAN) parad...
Fabrizio Falchi, Claudio Gennaro, Pavel Zezula