Sciweavers

951 search results - page 34 / 191
» Groupwise Processing of Relational Queries
Sort
View
VLDB
1999
ACM
127views Database» more  VLDB 1999»
15 years 2 months ago
Evaluating Top-k Selection Queries
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
Surajit Chaudhuri, Luis Gravano
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
15 years 11 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
15 years 10 months ago
Authenticated join processing in outsourced databases
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...
Yin Yang, Dimitris Papadias, Stavros Papadopoulos,...
VLDB
1989
ACM
114views Database» more  VLDB 1989»
15 years 1 months ago
Extending the Relational Algebra to Capture Complex Objects
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Bernhard Mitschang
VLDB
1989
ACM
104views Database» more  VLDB 1989»
15 years 1 months ago
Event-Join Optimization in Temporal Relational Databases
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
Arie Segev, Himawan Gunadhi