Sciweavers

1888 search results - page 194 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
CIDR
2007
144views Algorithms» more  CIDR 2007»
15 years 5 months ago
Cache-Oblivious Query Processing
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
Bingsheng He, Qiong Luo
BDA
2001
15 years 5 months ago
Rewriting and Evaluating Tree Queries with XPath
A Community Web portal is a set of tools for a community of people who want to share information on a certain domain via the Web. The backbone of this system is an ontology which ...
Bernd Amann, Catriel Beeri, Irini Fundulaki, Miche...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 9 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
DASFAA
2004
IEEE
76views Database» more  DASFAA 2004»
15 years 8 months ago
XTree for Declarative XML Querying
Abstract. How to query XML documents to extract and restructure the information is an important issue in XML research. Currently, XQuery based on XPath is the most promising standa...
Zhuo Chen, Tok Wang Ling, Mengchi Liu, Gillian Dob...
SIGIR
2006
ACM
15 years 10 months ago
A study of statistical models for query translation: finding a good unit of translation
This paper presents a study of three statistical query translation models that use different units of translation. We begin with a review of a word-based translation model that us...
Jianfeng Gao, Jian-Yun Nie