Sciweavers

3225 search results - page 367 / 645
» Query Optimization by Stored Queries
Sort
View
PVLDB
2008
128views more  PVLDB 2008»
15 years 6 months ago
Implementing filesystems by tree-aware DBMSs
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
Alexander Holupirek, Marc H. Scholl
DEBS
2003
ACM
15 years 12 months ago
MJoin: a metadata-aware stream join operator
Join algorithms must be re-designed when processing stream data instead of persistently stored data. Data streams are potentially infinite and the query result is expected to be ...
Luping Ding, Elke A. Rundensteiner, George T. Hein...
VLDB
1991
ACM
165views Database» more  VLDB 1991»
15 years 10 months ago
Aggregation and Relevance in Deductive Databases
In this paper we present a technique to optimize queries on deductive databases that use aggregate operations such as min, max, and “largest Ic values.” Our approach is based ...
S. Sudarshan, Raghu Ramakrishnan
CORR
2008
Springer
122views Education» more  CORR 2008»
15 years 6 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková
CPM
2010
Springer
145views Combinatorics» more  CPM 2010»
15 years 1 months ago
Succinct Representations of Separable Graphs
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
Guy E. Blelloch, Arash Farzan