Sciweavers

1573 search results - page 221 / 315
» A Data Structure for Sponsored Search
Sort
View
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 5 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau
VLDB
1999
ACM
131views Database» more  VLDB 1999»
15 years 4 months ago
High-Performance Extensible Indexing
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
Marcel Kornacker
VLDB
1999
ACM
87views Database» more  VLDB 1999»
15 years 4 months ago
Query Optimization for XML
XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect...
Jason McHugh, Jennifer Widom
115
Voted
ISMIS
1997
Springer
15 years 4 months ago
Knowledge-Based Image Retrieval with Spatial and Temporal Constructs
e about image features can be expressed as a hierarchical structure called a Type Abstraction Hierarchy (TAH). TAHs can be generated automatically by clustering algorithms based on...
Wesley W. Chu, Alfonso F. Cardenas, Ricky K. Taira
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
15 years 1 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...