Sciweavers

1008 search results - page 139 / 202
» Logic and Databases
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 9 months ago
A comparison of flexible schemas for software as a service
A multi-tenant database system for Software as a Service (SaaS) should offer schemas that are flexible in that they can be extended for different versions of the application and d...
Stefan Aulbach, Dean Jacobs, Alfons Kemper, Michae...
WWW
2004
ACM
14 years 10 months ago
Edgecomputing: extending enterprise applications to the edge of the internet
Content delivery networks have evolved beyond traditional distributed caching. With services such as Akamai's EdgeComputing it is now possible to deploy and run enterprise bu...
Andy Davis, Jay Parikh, William E. Weihl
ICDT
2010
ACM
147views Database» more  ICDT 2010»
14 years 29 days ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
FOCS
1998
IEEE
14 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
14 years 11 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa