304 search results - page 19 / 61 » Dynamic ordered sets with exponential search trees |
KDD
2004
ACM
14 years 9 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
ICDE
2008
IEEE
14 years 3 months ago
2008
IEEE
— This paper introduces a novel keyword searching paradigm in Relational Databases (DBs), where the result of a search is a ranked set of Object Summaries (OSs). An OS summarizes...
AINA
2009
IEEE
14 years 3 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
ACL
2009
13 years 6 months ago
2009
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
BIRTHDAY
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...