Sciweavers

2070 search results - page 313 / 414
» Querying Communities in Relational Databases
Sort
View
PODS
2002
ACM
98views Database» more  PODS 2002»
15 years 11 months ago
On Propagation of Deletions and Annotations Through Views
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
15 years 11 months ago
Context-sensitive ranking
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
Rakesh Agrawal, Ralf Rantzau, Evimaria Terzi
93
Voted
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 11 months 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...
ICDE
2002
IEEE
181views Database» more  ICDE 2002»
15 years 4 months ago
YFilter: Efficient and Scalable Filtering of XML Documents
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
Yanlei Diao, Peter M. Fischer, Michael J. Franklin...
WEBDB
2007
Springer
79views Database» more  WEBDB 2007»
15 years 5 months ago
Navigating Extracted Data with Schema Discovery
Open Information Extraction (OIE) is a recently-introduced type of information extraction that extracts small individual pieces of data from input text without any domainspecific...
Michael J. Cafarella, Dan Suciu, Oren Etzioni