Sciweavers

511 search results - page 37 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
ICDE
1999
IEEE
89views Database» more  ICDE 1999»
16 years 7 months ago
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the ...
Steven Geffner, Divyakant Agrawal, Amr El Abbadi, ...
CIKM
2010
Springer
15 years 4 months ago
On the selectivity of multidimensional routing indices
Recently, the problem of efficiently supporting advanced query operators, such as nearest neighbor or range queries, over multidimensional data in widely distributed environments...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
FQAS
2009
Springer
196views Database» more  FQAS 2009»
15 years 10 months ago
Flexible SPARQL Querying of Web Data Tables Driven by an Ontology
This paper concerns the design of a workflow which permits to feed and query a data warehouse opened on the Web, driven by a domain ontology. This data warehouse has been built to...
Patrice Buche, Juliette Dibie-Barthélemy, H...
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
16 years 7 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
FQAS
2006
Springer
186views Database» more  FQAS 2006»
15 years 9 months ago
Query Phrase Suggestion from Topically Tagged Session Logs
Searchers' difficulty in formulating effective queries for their information needs is well known. Analysis of search session logs shows that users often pose short, vague quer...
Eric C. Jensen, Steven M. Beitzel, Abdur Chowdhury...