Sciweavers

736 search results - page 42 / 148
» Answering Imprecise Queries over Web Databases
Sort
View
DBPL
2007
Springer
103views Database» more  DBPL 2007»
13 years 11 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
EDBT
2009
ACM
144views Database» more  EDBT 2009»
13 years 11 months ago
Efficient maintenance techniques for views over active documents
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu
DEBU
2010
147views more  DEBU 2010»
13 years 7 months ago
Evaluating the Effectiveness of Keyword Search
The prevalence of free text search in web search engines has inspired recent interest in keyword search on relational databases. Whereas relational queries formally specify matchi...
William Webber
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Simultaneous scalability and security for data-intensive web applications
For Web applications in which the database component is the bottleneck, scalability can be provided by a third-party Database Scalability Service Provider (DSSP) that caches appli...
Amit Manjhi, Anastassia Ailamaki, Bruce M. Maggs, ...
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 7 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan