Sciweavers

2555 search results - page 372 / 511
» Quantifiers and Working Memory
Sort
View
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 5 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 5 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
16 years 5 months ago
XStream: a Signal-Oriented Data Stream Management System
Sensors capable of sensing phenomena at high data rates on the order of tens to hundreds of thousands of samples per second are now widely deployed in many industrial, civil engine...
Lewis Girod, Yuan Mei, Ryan Newton, Stanislav Rost...
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
16 years 5 months ago
Clustering wavelets to speed-up data dissemination in structured P2P MANETs
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
Mihai Lupu, Jianzhong Li, Beng Chin Ooi, Shengfei ...
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 5 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han