Sciweavers

22 search results - page 2 / 5
» ECC: Do We Need to Count
Sort
View
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 9 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
LICS
2005
IEEE
13 years 11 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
IS
2008
13 years 5 months ago
On the expressibility of functions in XQuery fragments
XQuery is a powerful XML query language with many features and syntactic constructs. For many common queries we do not need all the expressive power of XQuery. We investigate the ...
Jan Hidders, Stefania Marrara, Jan Paredaens, Roel...
DBPL
2005
Springer
93views Database» more  DBPL 2005»
13 years 7 months ago
On the Expressive Power of XQuery Fragments
XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the eff...
Jan Hidders, Stefania Marrara, Jan Paredaens, Roel...
EMSOFT
2004
Springer
13 years 11 months ago
Binary translation to improve energy efficiency through post-pass register re-allocation
Energy efficiency is rapidly becoming a first class optimization parameter for modern systems. Caches are critical to the overall performance and thus, modern processors (both hig...
Kun Zhang, Tao Zhang, Santosh Pande