— If we consider a query involving multiple domains, such as “find all database conferences held within six months in locations whose seasonal average temperature is 28◦ C a...
Daniele Braga, Diego Calvanese, Alessandro Campi, ...
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
We introduce an event gazetteer which stores and presents “locations in time”. Each event is coded with attributes of event type, location, actor, and beginning and ending tim...