Sciweavers

243 search results - page 28 / 49
» Selectivity Estimation for Boolean Queries
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
INFOCOM
2005
IEEE
15 years 3 months ago
Distributed querying of Internet distance information
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
Rodrigo Fonseca, Puneet Sharma, Sujata Banerjee, S...
ILP
2003
Springer
15 years 2 months ago
Query Optimization in Inductive Logic Programming by Reordering Literals
Query optimization is used frequently in relational database management systems. Most existing techniques are based on reordering the relational operators, where the most selective...
Jan Struyf, Hendrik Blockeel
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
15 years 11 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura
ICML
2005
IEEE
15 years 10 months ago
Active learning for Hidden Markov Models: objective functions and algorithms
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
Brigham Anderson, Andrew Moore