Sciweavers

6974 search results - page 357 / 1395
» Querying Semi-Structured Data
Sort
View
SEMWEB
2010
Springer
15 years 4 months ago
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
Yingjie Li, Jeff Heflin
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 8 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
PKDD
2009
Springer
149views Data Mining» more  PKDD 2009»
16 years 1 months ago
Learning to Disambiguate Search Queries from Short Sessions
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for ...
Lilyana Mihalkova, Raymond J. Mooney
DAWAK
2007
Springer
16 years 29 days ago
Domination Mining and Querying
Abstract. Pareto dominance plays an important role in diverse application domains such as economics and e-commerce, and it is widely being used in multicriteria decision making. In...
Apostolos N. Papadopoulos, Apostolos Lyritsis, Ale...
DEBU
2010
104views more  DEBU 2010»
15 years 6 months ago
Query Results Ready, Now What?
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
Ziyang Liu, Yi Chen