Sciweavers

721 search results - page 136 / 145
» Supporting top-k join queries in relational databases
Sort
View
101
Voted
ADC
2010
Springer
266views Database» more  ADC 2010»
14 years 4 months ago
Counting distinct objects over sliding windows
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we ...
Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, X...
HT
1998
ACM
15 years 1 months ago
Enforcing Strong Object Typing in Flexible Hypermedia
The presentation layer of hypermedia systems could benefit from standard object querying functionality and this is most effective if strong typing is enforced. By strong typing we...
Pedro Furtado, Henrique Madeira
100
Voted
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
15 years 10 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
DATESO
2007
107views Database» more  DATESO 2007»
14 years 11 months ago
Updating Typed XML Documents Using a Functional Data Model
We address a problem of updating XML documents having their XML schema described by a Document Type Definition (DTD) without breaking their validity. We present a way how to expre...
Pavel Loupal
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
15 years 4 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...