Sciweavers

303 search results - page 36 / 61
» Using a compact tree to index and query XML data
Sort
View
MM
1994
ACM
143views Multimedia» more  MM 1994»
13 years 11 months ago
Quad-Tree Segmentation for Texture-Based Image Query
In this paper we propose a technique for segmenting images by texture content with application to indexing images in a large image database. Using a quad-tree decomposition, textu...
Jonathan M. Smith, Shih-Fu Chang
VLDB
2007
ACM
152views Database» more  VLDB 2007»
14 years 7 months ago
Structured Materialized Views for XML Queries
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
Andrei Arion, Ioana Manolescu, Véronique Be...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 5 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
14 years 9 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
SIGIR
2009
ACM
14 years 2 months ago
Estimating query performance using class predictions
We investigate using topic prediction data, as a summary of document content, to compute measures of search result quality. Unlike existing quality measures such as query clarity ...
Kevyn Collins-Thompson, Paul N. Bennett