Sciweavers

1666 search results - page 226 / 334
» Effective and efficient structured retrieval
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 10 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
VLDB
2005
ACM
132views Database» more  VLDB 2005»
14 years 10 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
VLDB
2008
ACM
178views Database» more  VLDB 2008»
14 years 10 months ago
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
Man Lung Yiu, Yufei Tao, Nikos Mamoulis
SIGMOD
2001
ACM
121views Database» more  SIGMOD 2001»
14 years 10 months ago
XML Document Versioning
Managing multiple versions of XML documents represents an important problem, because of many applications ranging from traditional ones, such as software configuration control, to...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo
ACIIDS
2009
IEEE
122views Database» more  ACIIDS 2009»
14 years 5 months ago
How to Maximize User Satisfaction Degree in Multi-service IP Networks
—Bandwidth allocation is a fundamental problem in communication networks. With current network moving towards the Future Internet model, the problem is further intensified as net...
Huy Anh Nguyen, Tam Van Nguyen, Deokjai Choi