Sciweavers

11212 search results - page 2050 / 2243
» Semi-persistent Data Structures
Sort
View
231
Voted
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
16 years 5 months ago
Efficient Computation of Diverse Query Results
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasund...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 5 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
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
16 years 5 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
16 years 5 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
228
Voted
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
16 years 5 months ago
SNAP: Efficient Snapshots for Back-in-Time Execution
SNAP is a novel high-performance snapshot system for object storage systems. The goal is to provide a snapshot service that is efficient enough to permit "back-in-time" ...
Liuba Shrira, Hao Xu
« Prev « First page 2050 / 2243 Last » Next »