Sciweavers

792 search results - page 14 / 159
» Computing Iceberg Queries Efficiently
Sort
View
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
TCSV
2010
13 years 2 months ago
Efficient and Robust Detection of Duplicate Videos in a Large Database
We present an efficient and accurate method for duplicate video detection in a large database using video fingerprints. We have empirically chosen the Color Layout Descriptor, a c...
Anindya Sarkar, Vishwakarma Singh, Pratim Ghosh, B...
DASFAA
2008
IEEE
151views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Top-k Search Across Heterogeneous XML Data Sources
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
Jianxin Li, Chengfei Liu, Jeffrey Xu Yu, Rui Zhou
DPD
2006
114views more  DPD 2006»
13 years 7 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav