Sciweavers

353 search results - page 31 / 71
» Processing Top-k Join Queries
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
VLDB
1993
ACM
101views Database» more  VLDB 1993»
13 years 12 months ago
Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems
Paralleldatabasesystemshaveto supportboth inter-transaction as well as intra-transaction parallelism. Inter-uansaction parahelism (multi-user mode) is required to achieve high thr...
Erhard Rahm, Robert Marek
ADC
2005
Springer
97views Database» more  ADC 2005»
14 years 1 months ago
Querying and Maintaining Ordered XML Data using Relational Databases
Although data stored in XML is of increasing importance, most existing data repositories are still managed by relational database systems. In light of this, recent XML database re...
William M. Shui, Franky Lam, Damien K. Fisher, Ray...
APWEB
2005
Springer
14 years 1 months ago
Labeling Scheme and Structural Joins for Graph-Structured XML Data
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...
Hongzhi Wang, Wei Wang 0011, Xuemin Lin, Jianzhong...
ISPAN
2002
IEEE
14 years 25 days ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar