Sciweavers

4337 search results - page 334 / 868
» Cache-Oblivious Query Processing
Sort
View
BTW
2009
Springer
117views Database» more  BTW 2009»
15 years 10 months ago
Bringing BLINK Closer to the Full Power of SQL
: BLINK is a prototype of an in-memory based query processor that exploits heavily the underlying CPU infrastructure. It is very sensitive to the processor’s caches and instructi...
Knut Stolze, Vijayshankar Raman, Richard Sidle, O....
CIDR
2007
128views Algorithms» more  CIDR 2007»
15 years 8 months ago
Cayuga: A General Purpose Event Monitoring System
We describe the design and implementation of the Cornell Cayuga System for scalable event processing. We present a query language based on Cayuga Algebra for naturally expressing ...
Alan J. Demers, Johannes Gehrke, Biswanath Panda, ...
PVLDB
2008
148views more  PVLDB 2008»
15 years 6 months ago
StreamTX: extracting tuples from streaming XML data
We study the problem of extracting flattened tuple data from streaming, hierarchical XML data. Tuple-extraction queries are essentially XML pattern queries with multiple extractio...
Wook-Shin Han, Haifeng Jiang, Howard Ho, Quanzhong...
GIS
2006
ACM
16 years 7 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera