Sciweavers

778 search results - page 115 / 156
» Modelling a Query Space Using Associations
Sort
View
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
15 years 2 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...
IPTPS
2005
Springer
15 years 7 months ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...
EUROCRYPT
2010
Springer
15 years 6 months ago
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...
Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Ka...
DASFAA
2007
IEEE
234views Database» more  DASFAA 2007»
15 years 8 months ago
Estimating Missing Data in Data Streams
Networks of thousands of sensors present a feasible and economic solution to some of our most challenging problems, such as real-time traffic modeling, military sensing and trackin...
Nan Jiang, Le Gruenwald
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 6 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye