Sciweavers

3652 search results - page 123 / 731
» A study of query length
Sort
View
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
12 years 11 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
SSD
2007
Springer
132views Database» more  SSD 2007»
14 years 2 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...
SACRYPT
1999
Springer
14 years 7 days ago
Key-Schedule Cryptanalysis of DEAL
DEAL is a six- or eight-round Luby-Rackoff cipher that uses DES as its round function, with allowed key lengths of 128, 192, and 256 bits. In this paper, we discuss two new result...
John Kelsey, Bruce Schneier
EDBT
2006
ACM
156views Database» more  EDBT 2006»
14 years 8 months ago
Constructing a Generic Natural Language Interface for an XML Database
Abstract. We describe the construction of a generic natural language query interface to an XML database. Our interface can accept an arbitrary English sentence as a query, which ca...
Yunyao Li, Huahai Yang, H. V. Jagadish
ACMSE
2005
ACM
14 years 1 months ago
Metadata management and relational databases
A simple extension to the relational model that permits metadata (more generally metaknowledge) to be stored and manipulated as first class data is proposed. The accompanying que...
Shun Yan Cheung, James J. Lu, Catharine M. Wyss