Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Dependency theory (database theory) (view), International Conference on Database Theory (view)

searching for Database theory 48 found (190 total)

Inheritance (object-oriented programming) (3,811 words) [view diff] no match in snippet view article

In object-oriented programming, inheritance is the mechanism of basing an object or class upon another object (prototype-based inheritance) or class (class-based

Concatenation (994 words) [view diff] no match in snippet view article find links to article

Wikifunctions has a concat function. In formal language theory and computer programming, string concatenation is the operation of joining character strings

Christopher J. Date (468 words) [view diff] exact match in snippet view article find links to article

lecturer, researcher, and consultant, specializing in relational database theory. Chris Date attended High Wycombe Royal Grammar School (U.K.) from

Neil Immerman (332 words) [view diff] exact match in snippet view article find links to article

an approach he is currently applying to research in model checking, database theory, and computational complexity theory. Professor Immerman is an editor

Algorithms for Recovery and Isolation Exploiting Semantics (1,312 words) [view diff] no match in snippet view article find links to article

In computer science, Algorithms for Recovery and Isolation Exploiting Semantics, or ARIES, is a recovery algorithm designed to work with a no-force, steal

Functional dependency (2,575 words) [view diff] exact match in snippet view article find links to article

In relational database theory, a functional dependency is the following constraint between two attribute sets in a relation: Given a relation R and attribute

Seymour Ginsburg (1,435 words) [view diff] exact match in snippet view article find links to article

an American pioneer of automata theory, formal language theory, and database theory, in particular; and computer science, in general. His work was influential

Computer science (6,671 words) [view diff] exact match in snippet view article find links to article

considers different ways to describe computational processes, and database theory concerns the management of repositories of data. Human–computer interaction

Relation (database) (1,292 words) [view diff] exact match in snippet view article

In database theory, a relation, as originally defined by E. F. Codd, is a set of tuples (d1,d2,...,dn), where each element dj is a member of Dj, a data

Sublanguage (581 words) [view diff] exact match in snippet view article find links to article

language (DCL), and a data manipulation language (DML). In relational database theory, the term "sublanguage", first used for this purpose by E. F. Codd

Functional decomposition (1,746 words) [view diff] no match in snippet view article find links to article

In engineering, functional decomposition is the process of resolving a functional relationship into its constituent parts in such a way that the original

Hugh Darwen (1,122 words) [view diff] case mismatch in snippet view article find links to article

of Warwick. ———————— (January 2009), An Introduction to Relational Database Theory (3rd ed.), BookBoon, ISBN 978-87-7681-500-4, 231 pp. ———————— (November

Unique name assumption (211 words) [view diff] exact match in snippet view article find links to article

in his 1984 article "Towards a logical reconstruction of relational database theory" (in M. L. Brodie, J. Mylopoulos, J. W. Schmidt (editors), Data Modelling

Dimensionality reduction (2,255 words) [view diff] case mismatch in snippet view article find links to article

Ramakrishnan, Uri Shaft (1999) "When is "nearest neighbor" meaningful?". Database Theory—ICDT99, 217–235 Shaw, B.; Jebara, T. (2009). "Structure preserving

Andrew U. Frank (1,358 words) [view diff] exact match in snippet view article find links to article

achievements in the fields of spatial information theory, spatial database theory, and ontology in GIS in a special section in his honor in IJGIS. He

Omega (3,038 words) [view diff] exact match in snippet view article find links to article

notation, the asymptotically dominant nature of functions In relational database theory to represent NULL, a missing or inapplicable value In APL, to represent

Christos Papadimitriou (981 words) [view diff] exact match in snippet view article find links to article

National Academy of Engineering for contributions to complexity theory, database theory, and combinatorial optimization. In 2009 he was elected to the US National

Tova Milo (534 words) [view diff] case mismatch in snippet view article find links to article

on Principles of Database Systems, the International Conference on Database Theory (ICDT), as well as the VLDB conference. She is a member of the ICDT

Giorgio Ausiello (623 words) [view diff] exact match in snippet view article find links to article

algorithms and complexity. Major scientific contributions concern database theory, approximability of NP-hard optimization problems, dynamic and online

David McGoveran (2,306 words) [view diff] exact match in snippet view article find links to article

computer science, he is recognized as one of the pioneers of relational database theory. David McGoveran majored in physics and mathematics, and minored in

Mobile database (421 words) [view diff] exact match in snippet view article find links to article

This may require application-specific automation features. This is in database theory known as "replication", and good mobile database system should provide

Fact table (1,057 words) [view diff] exact match in snippet view article find links to article

of the creation of the row. Temporal snapshots By applying temporal database theory and modeling techniques the temporal snapshot fact table allows to

Concurrent computing (2,980 words) [view diff] exact match in snippet view article find links to article

of concurrent systems. Software transactional memory borrows from database theory the concept of atomic transactions and applies them to memory accesses

Tz database (4,145 words) [view diff] no match in snippet view article find links to article

original on 5 March 2021. Retrieved 16 December 2020. "Scope of the tz database". Theory and pragmatics of the tz code and data. Archived from the original

Artifact-centric business process model (1,521 words) [view diff] case mismatch in snippet view article find links to article

processes, in Proceedings of the 12th International Conference on Database Theory. 2009, ACM: St. Petersburg, Russia. Deutsch, A., et al., Automatic

Type class (2,297 words) [view diff] exact match in snippet view article find links to article

dependencies between type parameters—a concept inspired from relational database theory. That is, the programmer can assert that a given assignment of some

Dagstuhl (1,471 words) [view diff] case mismatch in snippet view article find links to article

International Conference on Concurrency Theory (CONCUR), and the Conference on Database Theory. As of 2024, the Leibnitz Center publishes two academic journals. The

Terminology-oriented database (269 words) [view diff] case mismatch in snippet view article find links to article

Kaufmann Publishers. ISBN 1-55860-647-5. Karge, R. (July 2003). Unified Database Theory (PDF document). The 7th World Multi-Conference on SYSTEMICS, CYBERNETICS

Data integration (3,739 words) [view diff] exact match in snippet view article find links to article

across databases. The theory of data integration forms a subset of database theory and formalizes the underlying concepts of the problem in first-order

Click fraud (3,922 words) [view diff] case mismatch in snippet view article find links to article

Networks. In Proceedings of the 10th ICDT International Conference on Database Theory" (PDF). pp. 398–412. Archived from the original (PDF) on 2020-07-31

Click fraud (3,922 words) [view diff] case mismatch in snippet view article find links to article

Networks. In Proceedings of the 10th ICDT International Conference on Database Theory" (PDF). pp. 398–412. Archived from the original (PDF) on 2020-07-31

K-nearest neighbors algorithm (4,316 words) [view diff] case mismatch in snippet view article find links to article

Beyer, Kevin; et al. "When is "nearest neighbor" meaningful?" (PDF). Database Theory—ICDT'99. 1999: 217–235. Shaw, Blake; Jebara, Tony (2009), "Structure

Curse of dimensionality (4,162 words) [view diff] case mismatch in snippet view article find links to article

Ramakrishnan, R.; Shaft, U. (1999). "When is "Nearest Neighbor" Meaningful?". Database Theory — ICDT'99. LNCS. Vol. 1540. pp. 217–235. doi:10.1007/3-540-49257-7_15

Two-phase commit protocol (1,910 words) [view diff] case mismatch in snippet view article find links to article

Yoav Raz (1995): "The Dynamic Two Phase Commitment (D2PC) protocol ",Database Theory — ICDT '95, Lecture Notes in Computer Science, Volume 893/1995, pp

Search engine indexing (4,732 words) [view diff] case mismatch in snippet view article find links to article

Computation on the Web. Proceedings of the International Conference on Database Theory. Delphi, Greece 1997. Ian H Witten, Alistair Moffat, and Timothy C

Business Intelligence Competency Center (427 words) [view diff] case mismatch in snippet view article find links to article

Applications are Revolutionizing Decision Making". International Journal of Database Theory & Application. 20 (1). Cearley, David (2017). "Top 10 Strategic Technology

Reverse data management (603 words) [view diff] exact match in snippet view article find links to article

management describes a branch and set of research questions in relational database theory that aim to reverse the common focus of standard data management. Instead

HiLog (601 words) [view diff] exact match in snippet view article find links to article

logic data languages". In Gottlob, Georg; Vardi, Moshe Y. (eds.). Database theory—ICDT '95: 5th International Conference, Prague, Czech Republic, January

Codd's theorem (570 words) [view diff] case mismatch in snippet view article find links to article

pp. 65–98. ISBN 0-13-196741-X. Pichler, Reinhard (March 20, 2018). "Database Theory: 3. Codd's Theorem" (PDF). Institute of Logic and Computation, DBAI

National CSS (1,920 words) [view diff] exact match in snippet view article find links to article

an interactive database management environment based on relational database theory, a new concept of the day. NOMAD was primarily sold to meet end-user

Lasso (statistics) (8,045 words) [view diff] case mismatch in snippet view article

in High Dimensional Space." In: Van den Bussche J., Vianu V. (eds) Database Theory — ICDT 2001. ICDT 2001. Lecture Notes in Computer Science, Vol. 1973

Laura M. Haas (792 words) [view diff] case mismatch in snippet view article find links to article

and the Beast: The Theory and Practice of Information Integration". Database Theory – ICDT 2007. Lecture Notes in Computer Science. Vol. 4353. pp. 28–43

Belief revision (7,935 words) [view diff] case mismatch in snippet view article find links to article

revision. In Proceedings of the Sixth International Conference on Database Theory (ICDT'97), pages 276–290. P. Liberatore and M. Schaerf (1998). Arbitration

Misra–Gries heavy hitters algorithm (992 words) [view diff] case mismatch in snippet view article find links to article

Wim Martens; Thomas Zeume (eds.). 19th International Conference on Database Theory (ICDT 2016). ICDT 2016. Vol. 48. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum

Grigory Yaroslavtsev (904 words) [view diff] case mismatch in snippet view article find links to article

advised by Sofya Raskhodnikova. During his Ph.D. he interned at the Database Theory Group of AT&T Labs, Shannon Laboratory and the Theory Groups of IBM

Cutwidth (2,377 words) [view diff] exact match in snippet view article find links to article

themselves and to maintain the data used for task-to-task communication. In database theory, the NP-hardness of the cutwidth problem has been used to show that

Query complexity (244 words) [view diff] exact match in snippet view article find links to article

participant preferences in a fair sharing procedure Query complexity in database theory, the complexity of evaluating a query on a database when measured as

Mark de Vos (882 words) [view diff] exact match in snippet view article find links to article

structure: A parallel between linguistic models of displacement and database theory". Lingua. 118 (12): 1864–1899. doi:10.1016/j.lingua.2008.05.002. De