Article

Free access

Languages for relational databases over interpreted structures

Authors:

Michael Benedikt,

Leonid LibkinAuthors Info & Claims

PODS '97: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 87 - 98

https://doi.org/10.1145/263661.263672

Published: 01 May 1997 Publication History

PDF eReader

References

[1]

S. Abiteboul, R. Hull and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

Google Scholar

[2]

S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. JUSS 43 (1991), 62-124.

Digital Library

Google Scholar

[3]

A.K. Ailamazyan, M.M. Gihla, A.P. Stolboushkin and G.F. Shwrts. Reduction of a rdational model with infinite domains to the finite-domain case. Soviet Physics - Doklady, 31 (1986), 11-13.

Google Scholar

[4]

D.A. Barrington, N. Immerman, H. Straubing. On uniformity within NC1. JOSS, 41:274-306,1990.

Digital Library

Google Scholar

[5]

C. Beeri and T. Milo. Functional and predicate programming in OODBs. in PODS'9~, pages 176-190.

Digital Library

Google Scholar

[6]

M. Benedikt, G. Dong, L. Libkin and L. Wong. Relationai expressive power of constraint query languages. In PODS'96, pages 5-16.

Digital Library

Google Scholar

[7]

M. Benedikt and L. Libkin. On the structure of queries in constraint query languages. LIUS'96, pages 25-34.

Digital Library

Google Scholar

[8]

M. Benedikt and L. Libkin. Languages for relational databases over interpreted structures. Technical Memo, Bell Labs, 1996.

Google Scholar

[9]

M. Ben-Or, D. Kozen, J. Reif. The complexity of elementary algebra and geometry. JOSS 32:251-264, 1986.

Digital Library

Google Scholar

[10]

L. Cabibbo and J. Van den Bussche. On the expressive power of many-sorted logic. Manuscript, 1996.

Google Scholar

[11]

A. Chandra and D. Hard. Computable queries for relational databases. JGSS 21(2):156-178, 1980.

Google Scholar

[12]

A. Chandra and D. Hard. Structure and complexity of relational queries. JGSS 25 (1982), 99-128.

Google Scholar

[13]

C.C. Chang and H.J. Keisler. Model Theory. North Holland, 1990.

Google Scholar

[14]

A. Dawar, S. LindeU, S. Weinstein. First order lo~c, fixed point logic, and linear order. In Computer Science Logic '95, LNGS vol. 1092, 1996, pages 161-177.

Digital Library

Google Scholar

[15]

H.-D. Ebbinghaus and J. Fhm. Finite Model Theory. Springer Verlag, 1995.

Crossref

Google Scholar

[16]

M. Escobar-Molano, R. Hull and D. Jacobs. Safety and translation of calculus queries with scalar functions. In PODS'93, pages 253-264.

Digital Library

Google Scholar

[17]

K. Etessami. Counting quantifiers, successor relations, and logarithmic space. JGSS, to appear.

Digital Library

Google Scholar

[18]

E. Gr~del and Y. Gurevich. MetMinite model theory. In Proc. LUG, LNCS vol. 96(1, 1994, pages 313-366.

Digital Library

Google Scholar

[19]

R.L. Graham, B.L. Rothschild and 3.H. Spencer. Ram. sey Theory. John Wiley & Sons, 1990.

Google Scholar

[20]

S. Gzumbach and J. Su. First-order definability over constraint databases, in PGGP'95.

Digital Library

Google Scholar

[21]

Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied I, ogic 32 (1986), 265-280.

Crossref

Google Scholar

[22]

R. Hull, J. Su. On the expressive power of databases with intermediate types. Jc.qs 43 (1991), 219-267.

Digital Library

Google Scholar

[23]

R. Hull and J. Su. Domain independence and the relational calculus. Acta Informatica 31:513-524, 1994.

Digital Library

Google Scholar

[24]

P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. JOSS 51 (1995), 26-52.

Digital Library

Google Scholar

[25]

M. Kifer, R. Rainakrishnan and A. Silberschatz, An axiomatic approach to deciding query safety in deductive databases. In PODS'88, pages 52-60.

Digital Library

Google Scholar

[26]

Ph. Kolaitis and M. Vardi. 0-1 laws and decision problems for fragments of second-order logic. Information and Computation, 87 (1990), 302-338.

Digital Library

Google Scholar

[27]

Ph. Kolaitis, M. Vardi. Infinitary logic and 0-1 laws. Information and Computation, 98 (1992), 258-294.

Digital Library

Google Scholar

[28]

A. Levy, I. Mumick, Y. Sagiv, O. Shmueli. Equivalence, query reachability and satisfiability in datalog extensions, in PODS'93, pages 109-122.

Digital Library

Google Scholar

[29]

L. Libkin and L. Wont. Query languages for bags and aggregate functions. JOSS, to appear. Extended abstract in PODS~gJ.

Digital Library

Google Scholar

[30]

Y. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.

Digital Library

Google Scholar

[31]

M. Otto and J. Van den Bussche. First-order queries on databases embedded in an infinite structure. Infor. marion Processing Letters~ to appear.

Digital Library

Google Scholar

[32]

J. Paredaens, J. Van den Bussche, and D. Van Gucht. First-order queries on finite structures over the reals, In LICS'95, pages 79-87.

Digital Library

Google Scholar

[33]

A. Pillay, C. Steinhorn. Definable sets in ordered structures. III. Trans. of the AMS 309 (1988), 469-476.

Crossref

Google Scholar

[34]

A.P. Stolboushkin and M.A. Taitslin. Linear vs. order constraint queries over rational databases. In PODSS96, pages 17~27.

Digital Library

Google Scholar

[35]

A. Tarski. A Decision Method }or Elementary Algebra and Geometry. 2nd ed., Univ. California Pressj 1951.

Crossref

Google Scholar

[36]

J. D. Ullman. Principles of Database and Knowledgo. base Systems, Volume I, Computer Science Press, 1989.

Digital Library

Google Scholar

[37]

M. Vardi. On the complexity of bounded-variable queries. In PODS'95, pages 266-276.

Digital Library

Google Scholar

Cited By

View all

Chapuis OKoiran P(2010)Definability of Geometric Properties in Algebraically Closed FieldsMathematical Logic Quarterly10.1002/malq.1999045041145:4(533-550)Online publication date: 17-Nov-2010
https://doi.org/10.1002/malq.19990450411
Geerts FKuijpers B(2007)Real Algebraic Geometry and Constraint DatabasesHandbook of Spatial Logics10.1007/978-1-4020-5587-4_13(799-856)Online publication date: 2007
https://doi.org/10.1007/978-1-4020-5587-4_13
Kuijpers B(2005)Degrees of monotonicity of spatial transformationsDatabase Programming Languages10.1007/3-540-64823-2_5(60-77)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3-540-64823-2_5
Show More Cited By

Index Terms

Languages for relational databases over interpreted structures

Recommendations

Finding Hidden Structures in Relational Databases
PAKDD '09: Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining

Relational database management systems have been widely used over decades. An important research issue is to find hidden structural information in large relational databases. By hidden structural information we mean the information that cannot be easily ...
Federating Object-Oriented and Relational Databases: The IRO-DB Experience
COOPIS '97: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems

From the beginning of 1994 to the end of 1996, the IRO-DB (Interoperable Relational and Object-Oriented Databases) ESPRIT project has developed tools for accessing relational and object-oriented databases in an integrated way, and for designing and ...
Non-Relational Databases in Big Data
ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies

These days' Big data is becoming a very essential component for the industries where large volume of data at very high speed is used to solve particular data problems. Generally, big data is first analyzed and then used with other available data in the ...

Comments

Information & Contributors

Information

Published In

PODS '97: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

May 1997

272 pages

ISBN:0897919106

DOI:10.1145/263661

Chairmen:
Alberto Mendelzon
Univ. of Toronto, Toronto, Ont., Canada
,
Z. Meral Özsoyoglu
Case Western Reserve Univ., Cleveland, OH

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS97

Sponsor:

SIGMOD

SIGMOD/PODS97: Joint ACM SIGMOD International Conference on Management of Data and ACM Symposium on Principles of Database Systems

May 11 - 15, 1997

Arizona, Tucson, USA

Acceptance Rates

PODS '97 Paper Acceptance Rate 23 of 118 submissions, 19%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
307
Total Downloads

Downloads (Last 12 months)34
Downloads (Last 6 weeks)10

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chapuis OKoiran P(2010)Definability of Geometric Properties in Algebraically Closed FieldsMathematical Logic Quarterly10.1002/malq.1999045041145:4(533-550)Online publication date: 17-Nov-2010
https://doi.org/10.1002/malq.19990450411
Geerts FKuijpers B(2007)Real Algebraic Geometry and Constraint DatabasesHandbook of Spatial Logics10.1007/978-1-4020-5587-4_13(799-856)Online publication date: 2007
https://doi.org/10.1007/978-1-4020-5587-4_13
Kuijpers B(2005)Degrees of monotonicity of spatial transformationsDatabase Programming Languages10.1007/3-540-64823-2_5(60-77)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3-540-64823-2_5
Dantsin EEiter TGottlob GVoronkov A(2001)Complexity and expressive power of logic programmingACM Computing Surveys10.1145/502807.50281033:3(374-425)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1145/502807.502810
Grahne GWaller E(2001)How to Make SQL Stand for String Query LanguageResearch Issues in Structured and Semistructured Database Programming10.1007/3-540-44543-9_5(61-79)Online publication date: 13-Apr-2001
https://doi.org/10.1007/3-540-44543-9_5
Grohe MSegoufin L(2000)On First-Order Topological QueriesProceedings of the 15th Annual IEEE Symposium on Logic in Computer Science10.5555/788022.789019Online publication date: 26-Jun-2000
https://dl.acm.org/doi/10.5555/788022.789019
Gross Dde Rougemont MVianu VGottlob G(2000)Uniform generation in spatial constraint databases and applications (Extended abstract)Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/335168.335228(254-259)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/335168.335228
Dantsin EVoronkov AVianu VGottlob G(2000)Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract)Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/335168.335218(157-165)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/335168.335218
Baldwin JBenedikt M(2000)Stability theory, permutations of indiscernibles, and embedded finite modelsTransactions of the American Mathematical Society10.1090/S0002-9947-00-02672-6352:11(4937-4969)Online publication date: 21-Jul-2000
https://doi.org/10.1090/S0002-9947-00-02672-6
Libkin LNurmonen J(2000)Counting and Locality over Finite Structures A SurveyGeneralized Quantifiers and Computation10.1007/3-540-46583-9_2(18-50)Online publication date: 10-Mar-2000
https://doi.org/10.1007/3-540-46583-9_2
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Finding Hidden Structures in Relational Databases

Federating Object-Oriented and Relational Databases: The IRO-DB Experience

Non-Relational Databases in Big Data

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Finding Hidden Structures in Relational Databases

Federating Object-Oriented and Relational Databases: The IRO-DB Experience

Non-Relational Databases in Big Data

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations