Sciweavers

950 search results - page 124 / 190
» Evaluation over thousands of queries
Sort
View
VLDB
1997
ACM
124views Database» more  VLDB 1997»
14 years 2 months ago
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
In this paper we describe novel techniques that make it possible to build an industrial-strength tool for automating the choice of indexes in the physical design of a SQL database...
Surajit Chaudhuri, Vivek R. Narasayya
PVLDB
2010
91views more  PVLDB 2010»
13 years 8 months ago
Navigating in Complex Mashed-Up Applications
Mashups integrate a set of Web-services and data sources, often referred to as mashlets. We study in this paper a common scenario where these mashlets are components of larger Web...
Daniel Deutch, Ohad Greenshpan, Tova Milo
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
14 years 11 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
ICPR
2002
IEEE
14 years 11 months ago
Building a Latent Semantic Index of an Image Database from Patterns of Relevance Feedback
This paper proposes a novel view of the information generated by relevance feedback. Latent semantic analysis is adapted to this view to extract useful inter-query information. Th...
Douglas R. Heisterkamp
DEXAW
2006
IEEE
153views Database» more  DEXAW 2006»
14 years 4 months ago
Extracting Partition Statistics from Semistructured Data
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
John N. Wilson, Richard Gourlay, Robert Japp, Math...