Sciweavers

796 search results - page 44 / 160
» A Formalization of ODMG Queries
Sort
View
CIKM
2005
Springer
15 years 5 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
VLDB
1995
ACM
150views Database» more  VLDB 1995»
15 years 3 months ago
Procedures in Object-Oriented Query Languages
We follow the stack-baaed approach to query languages which is a new formal and intellectual paradigm for integrating querying and programming for object-oriented databases. Queri...
Kazimierz Subieta, Yahiko Kambayashi, Jacek Leszcz...
DLOG
2006
15 years 1 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
DEXAW
2010
IEEE
150views Database» more  DEXAW 2010»
15 years 28 days ago
Search Strategies for Keyword-based Queries
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
Matthias Hagen, Benno Stein
CIKM
2010
Springer
14 years 10 months ago
Improving verbose queries using subset distribution
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
Xiaobing Xue, Samuel Huston, W. Bruce Croft