Sciweavers

716 search results - page 33 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
IS
2007
14 years 11 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki
VLDB
2002
ACM
141views Database» more  VLDB 2002»
15 years 11 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
15 years 4 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...
CIDR
2011
253views Algorithms» more  CIDR 2011»
14 years 2 months ago
Answering Queries using Humans, Algorithms and Databases
For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is ei...
Aditya G. Parameswaran, Neoklis Polyzotis
FGCS
2000
81views more  FGCS 2000»
14 years 11 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch