Sciweavers

611 search results - page 29 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
SAC
2009
ACM
14 years 2 months ago
Enhancing XML data warehouse query performance by fragmentation
XML data warehouses form an interesting basis for decisionsupport applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currentl...
Hadj Mahboubi, Jérôme Darmont
PCI
2001
Springer
14 years 4 days ago
SEISMO-SURFER: A Prototype for Collecting, Querying, and Mining Seismic Data
Earthquake phenomena constitute a rich source of information over the years. Typically, the frequency of earthquakes worldwide is one every second. Collecting and querying seismic ...
Yannis Theodoridis
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
14 years 1 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
VLDB
2000
ACM
163views Database» more  VLDB 2000»
13 years 11 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
SIGIR
2008
ACM
13 years 7 months ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero