Sciweavers

278 search results - page 18 / 56
» Adapting Partitioned Continuous Query Processing in Distribu...
Sort
View
93
Voted
VLDB
2005
ACM
112views Database» more  VLDB 2005»
15 years 3 months ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...
86
Voted
IADT
1998
149views more  IADT 1998»
14 years 11 months ago
Transparent Integration of Continuous Media Support into a Multimedia DBMS
Multimedia Database Management Systems (MMDBMS) have to efficiently provide the specific functionalities required by time-dependent multimedia data types. During presentation play...
Silvia Hollfelder, Florian Schmidt, Matthias Hemmj...
ICDE
1999
IEEE
143views Database» more  ICDE 1999»
15 years 11 months ago
Query Routing in Large-Scale Digital Library Systems
Modern digital libraries require user-friendly and yet responsive access to the rapidly growing, heterogeneous, and distributed collection of information sources. However, the inc...
Ling Liu
89
Voted
IDEAS
2008
IEEE
153views Database» more  IDEAS 2008»
15 years 4 months ago
Pattern based processing of XPath queries
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
Gerard Marks, Mark Roantree
78
Voted
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 1 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer