Sciweavers

147 search results - page 17 / 30
» Size Bounds and Query Plans for Relational Joins
Sort
View
VLDB
2004
ACM
227views Database» more  VLDB 2004»
14 years 26 days ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
14 years 7 months ago
A Comprehensive XQuery to SQL Translation using Dynamic Interval Encoding
The W3C XQuery language recommendation, based on a hierarchical and ordered document model, supports a wide variety of constructs and use cases. There is a diversity of approaches...
David DeHaan, David Toman, Mariano P. Consens, M. ...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 23 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
MMDB
2003
ACM
178views Multimedia» more  MMDB 2003»
14 years 23 days ago
Video query processing in the VDBMS testbed for video database research
The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content...
Walid G. Aref, Moustafa A. Hammad, Ann Christine C...
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
14 years 7 months ago
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main featur...
Peter A. Boncz, Torsten Grust, Maurice van Keulen,...