Sciweavers

2771 search results - page 82 / 555
» Locality of Queries and Transformations
Sort
View
EXTREME
2004
ACM
15 years 10 months ago
A Simple Proof for the Turing-Completeness of XSLT and XQuery
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
Stephan Kepser
VLDB
2000
ACM
151views Database» more  VLDB 2000»
15 years 8 months ago
The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies
We present the TreeScape system that, unlike any other system known to the authors, enables the reuse of pre-computed aggregate query results for irregular dimension hierarchies, ...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
ACL
2010
15 years 2 months ago
Learning Phrase-Based Spelling Error Models from Clickthrough Data
This paper explores the use of clickthrough data for query spelling correction. First, large amounts of query-correction pairs are derived by analyzing users' query reformula...
Xu Sun, Jianfeng Gao, Daniel Micol, Chris Quirk
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 4 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...