Sciweavers

796 search results - page 88 / 160
» A Formalization of ODMG Queries
Sort
View
109
Voted
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 28 days ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
100
Voted
WWW
2010
ACM
15 years 7 months ago
Competing for users' attention: on the interplay between organic and sponsored search results
Queries on major Web search engines produce complex result pages, primarily composed of two types of information: organic results, that is, short descriptions and links to relevan...
Cristian Danescu-Niculescu-Mizil, Andrei Z. Broder...
GIS
2009
ACM
15 years 7 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
107
Voted
CIDR
2009
119views Algorithms» more  CIDR 2009»
15 years 1 months ago
DBMSs Should Talk Back Too
Natural language user interfaces to database systems have been studied for several decades now. They have mainly focused on parsing and interpreting natural language queries to ge...
Alkis Simitsis, Yannis E. Ioannidis
102
Voted
DKE
2006
94views more  DKE 2006»
15 years 25 days ago
Extending the data warehouse for service provisioning data
The last few years, there has been an extensive body of literature in data warehousing applications that primarily focuses on basket-type (transactional) data, common in retail in...
Yannis Kotidis