Sciweavers

5954 search results - page 164 / 1191
» Querying Bi-level Information
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
DAWAK
2006
Springer
15 years 9 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
EMNLP
2007
15 years 7 months ago
Improving Query Spelling Correction Using Web Search Results
Traditional research on spelling correction in natural language processing and information retrieval literature mostly relies on pre-defined lexicons to detect spelling errors. Bu...
Qing Chen, Mu Li, Ming Zhou
INEX
2004
Springer
15 years 11 months ago
If INEX Is the Answer, What Is the Question?
The INEX query languages allow the extraction of fragments from selected documents. This power is not much used in INEX queries. The paper suggests reasons why, and considers which...
Richard A. O'Keefe
CIKM
2005
Springer
15 years 11 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...