Sciweavers

1238 search results - page 75 / 248
» View-based query containment
Sort
View
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 4 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
SIGMOD
2009
ACM
150views Database» more  SIGMOD 2009»
16 years 3 months ago
DBDOC: querying and browsing databases and interrelated documents
Large collections of documents are commonly created around a database, where a typical database schema may contain hundreds of tables and thousands of columns. We developed a syst...
Carlos Garcia-Alvarado, Carlos Ordonez, Zhibo Chen...
SIGMOD
2005
ACM
146views Database» more  SIGMOD 2005»
16 years 3 months ago
Predicate Result Range Caching for Continuous Queries
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
Matthew Denny, Michael J. Franklin
161
Voted
XSYM
2007
Springer
150views Database» more  XSYM 2007»
15 years 9 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
DBISP2P
2005
Springer
129views Database» more  DBISP2P 2005»
15 years 8 months ago
Querying a Super-Peer in a Schema-Based Super-Peer Network
We propose a novel approach for de ning and querying a super-peer within a schema-based super-peer network organized into a two-level architecture: the low level, called the peer l...
Domenico Beneventano, Sonia Bergamaschi, Francesco...