Sciweavers

950 search results - page 25 / 190
» Evaluation over thousands of queries
Sort
View
SYRCODIS
2007
92views Database» more  SYRCODIS 2007»
15 years 28 days ago
A Method for Evaluating Full-text Search Queries in Native XML Databases
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and pr...
Roman Pastukhov
DBPL
1999
Springer
101views Database» more  DBPL 1999»
15 years 4 months ago
On the Power of Incremental Evaluation in SQL-Like Languages
We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) ...
Leonid Libkin, Limsoon Wong
PVLDB
2008
118views more  PVLDB 2008»
14 years 11 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
ICDT
2003
ACM
121views Database» more  ICDT 2003»
15 years 5 months ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers
DL
1997
Springer
117views Digital Library» more  DL 1997»
15 years 4 months ago
Evaluating the Cost of Boolean Query Mapping
Non-uniform query languages make searching over heterogeneous information sources difficult. Our approach is to allow a user to compose Boolean queries in one rich front-end lang...
Kevin Chen-Chuan Chang, Hector Garcia-Molina