Sciweavers

931 search results - page 44 / 187
» Storage and Querying of E-Commerce Data
Sort
View
PODS
1997
ACM
117views Database» more  PODS 1997»
14 years 1 months ago
On the Analysis of Indexing Schemes
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
Joseph M. Hellerstein, Elias Koutsoupias, Christos...
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
12 years 12 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 11 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
INFOVIS
2003
IEEE
14 years 2 months ago
Empirical Comparison of Dynamic Query Sliders and Brushing Histograms
Dynamic queries facilitate rapid exploration of information by real-time visual display of both query formulation and results. Dynamic query sliders are linked to the main visuali...
Qing Li, Chris North
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
14 years 10 months ago
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
Stratos Idreos, Christos Tryfonopoulos, Manolis Ko...