Sciweavers

796 search results - page 71 / 160
» A Formalization of ODMG Queries
Sort
View
WWW
2008
ACM
15 years 6 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
ICDE
2010
IEEE
178views Database» more  ICDE 2010»
15 years 4 months ago
The Hybrid-Layer Index: A synergic approach to answering top-k queries in arbitrary subspaces
In this paper, we propose the Hybrid-Layer Index (simply, the HL-index) that is designed to answer top-k queries efficiently when the queries are expressed on any arbitrary subset ...
Jun-Seok Heo, Junghoo Cho, Kyu-Young Whang
155
Voted
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 10 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
ICDE
2010
IEEE
177views Database» more  ICDE 2010»
16 years 1 months ago
Optimal load shedding with aggregates and mining queries
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...
Barzan Mozafari, Carlo Zaniolo
161
Voted
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
16 years 14 days ago
Restricted Queries over an Encrypted Index with Applications to Regulatory Compliance
Compliance storage is an increasingly important area for businesses faced with a myriad of new document retention regulations. Today, businesses have turned to Write-One Read Many ...
Nikita Borisov, Soumyadeb Mitra